./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_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_FNV_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 c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:47:28,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:47:28,271 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:47:28,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:47:28,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:47:28,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:47:28,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:47:28,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:47:28,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 09:47:28,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 09:47:28,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:47:28,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:47:28,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:47:28,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:47:28,304 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:47:28,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:47:28,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:47:28,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:47:28,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:47:28,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:47:28,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:47:28,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:47:28,305 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 09:47:28,305 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 09:47:28,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:47:28,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:47:28,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 09:47:28,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:47:28,306 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:47:28,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:47:28,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:47:28,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:47:28,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:47:28,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:47:28,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 09:47:28,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:47:28,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:47:28,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:47:28,307 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 -> c7b5cea41c34641368705a00e3051c009f6877551b3530b7d4fceaf386f5f58c [2025-02-06 09:47:28,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:47:28,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:47:28,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:47:28,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:47:28,601 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:47:28,603 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_FNV_test5-1.i [2025-02-06 09:47:30,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c60f4fe1c/b4cc76d86c2845238c3080eab9b7601b/FLAG82ac9ec2e [2025-02-06 09:47:30,350 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:47:30,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-1.i [2025-02-06 09:47:30,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c60f4fe1c/b4cc76d86c2845238c3080eab9b7601b/FLAG82ac9ec2e [2025-02-06 09:47:30,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c60f4fe1c/b4cc76d86c2845238c3080eab9b7601b [2025-02-06 09:47:30,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:47:30,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:47:30,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:47:30,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:47:30,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:47:30,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:47:30" (1/1) ... [2025-02-06 09:47:30,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc317e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:30, skipping insertion in model container [2025-02-06 09:47:30,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:47:30" (1/1) ... [2025-02-06 09:47:30,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:47:30,961 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:47:30,996 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:47:31,000 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:47:31,005 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:47:31,010 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:47:31,039 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:47:31,041 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:47:31,043 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:47:31,047 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:47:31,067 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:47:31,068 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:47:31,069 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:47:31,069 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:47:31,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:47:31,095 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:47:31,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:47:31,257 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:47:31,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31 WrapperNode [2025-02-06 09:47:31,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:47:31,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:47:31,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:47:31,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:47:31,264 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:47:31" (1/1) ... [2025-02-06 09:47:31,310 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:47:31" (1/1) ... [2025-02-06 09:47:31,404 INFO L138 Inliner]: procedures = 177, calls = 375, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1974 [2025-02-06 09:47:31,405 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:47:31,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:47:31,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:47:31,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:47:31,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,545 INFO L175 MemorySlicer]: Split 349 memory accesses to 3 slices as follows [323, 2, 24]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 83 writes are split as follows [82, 0, 1]. [2025-02-06 09:47:31,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:47:31,665 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:47:31,665 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:47:31,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:47:31,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (1/1) ... [2025-02-06 09:47:31,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:47:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:47:31,703 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:47:31,707 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:47:31,735 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 09:47:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 09:47:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 09:47:31,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 09:47:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 09:47:31,736 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 09:47:31,737 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 09:47:31,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:47:31,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:47:31,981 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:47:31,983 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:47:33,693 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:47:33,841 INFO L? ?]: Removed 484 outVars from TransFormulas that were not future-live. [2025-02-06 09:47:33,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:47:33,911 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:47:33,915 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 09:47:33,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:47:33 BoogieIcfgContainer [2025-02-06 09:47:33,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:47:33,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:47:33,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:47:33,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:47:33,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:47:30" (1/3) ... [2025-02-06 09:47:33,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7e602d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:47:33, skipping insertion in model container [2025-02-06 09:47:33,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:47:31" (2/3) ... [2025-02-06 09:47:33,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7e602d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:47:33, skipping insertion in model container [2025-02-06 09:47:33,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:47:33" (3/3) ... [2025-02-06 09:47:33,925 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-1.i [2025-02-06 09:47:33,938 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:47:33,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test5-1.i that has 6 procedures, 574 locations, 1 initial locations, 49 loop locations, and 2 error locations. [2025-02-06 09:47:34,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:47:34,021 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;@3351feb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:47:34,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 09:47:34,029 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:47:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 09:47:34,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:34,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 09:47:34,037 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:34,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash 964108543, now seen corresponding path program 1 times [2025-02-06 09:47:34,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:34,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356602421] [2025-02-06 09:47:34,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:34,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 09:47:34,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 09:47:34,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:34,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:34,249 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:47:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:34,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356602421] [2025-02-06 09:47:34,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356602421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:34,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:47:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:47:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31961802] [2025-02-06 09:47:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:34,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:47:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:34,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:47:34,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:47:34,288 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:47:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:34,590 INFO L93 Difference]: Finished difference Result 1110 states and 1630 transitions. [2025-02-06 09:47:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:47:34,592 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:47:34,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:34,615 INFO L225 Difference]: With dead ends: 1110 [2025-02-06 09:47:34,615 INFO L226 Difference]: Without dead ends: 1108 [2025-02-06 09:47:34,617 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:47:34,619 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 781 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:47:34,621 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:47:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-02-06 09:47:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 564. [2025-02-06 09:47:34,709 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:47:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 824 transitions. [2025-02-06 09:47:34,719 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 824 transitions. Word has length 5 [2025-02-06 09:47:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:34,719 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 824 transitions. [2025-02-06 09:47:34,719 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:47:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 824 transitions. [2025-02-06 09:47:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 09:47:34,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:34,731 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:47:34,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:47:34,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1278175710, now seen corresponding path program 1 times [2025-02-06 09:47:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:34,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365947426] [2025-02-06 09:47:34,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:34,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:34,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 09:47:34,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 09:47:34,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:34,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:35,597 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:47:35,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365947426] [2025-02-06 09:47:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365947426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:47:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:47:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170916968] [2025-02-06 09:47:35,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:35,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:47:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:35,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:47:35,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:47:35,601 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:47:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:35,863 INFO L93 Difference]: Finished difference Result 567 states and 820 transitions. [2025-02-06 09:47:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:47:35,865 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:47:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:35,870 INFO L225 Difference]: With dead ends: 567 [2025-02-06 09:47:35,871 INFO L226 Difference]: Without dead ends: 567 [2025-02-06 09:47:35,871 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:47:35,872 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 105 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:47:35,873 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:47:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-06 09:47:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 564. [2025-02-06 09:47:35,896 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:47:35,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 817 transitions. [2025-02-06 09:47:35,899 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 817 transitions. Word has length 206 [2025-02-06 09:47:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:35,900 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 817 transitions. [2025-02-06 09:47:35,900 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:47:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 817 transitions. [2025-02-06 09:47:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-06 09:47:35,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:35,907 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:47:35,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:47:35,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:35,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2146269093, now seen corresponding path program 1 times [2025-02-06 09:47:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409015691] [2025-02-06 09:47:35,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:36,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-06 09:47:36,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-06 09:47:36,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:36,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:36,292 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:47:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409015691] [2025-02-06 09:47:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409015691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:47:36,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:47:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551406313] [2025-02-06 09:47:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:47:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:36,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:47:36,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:47:36,294 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:47:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:36,500 INFO L93 Difference]: Finished difference Result 692 states and 1004 transitions. [2025-02-06 09:47:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:47:36,502 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:47:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:36,505 INFO L225 Difference]: With dead ends: 692 [2025-02-06 09:47:36,508 INFO L226 Difference]: Without dead ends: 692 [2025-02-06 09:47:36,509 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:47:36,509 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.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:36,510 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.2s Time] [2025-02-06 09:47:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-02-06 09:47:36,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2025-02-06 09:47:36,531 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:47:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1004 transitions. [2025-02-06 09:47:36,535 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1004 transitions. Word has length 206 [2025-02-06 09:47:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:36,536 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1004 transitions. [2025-02-06 09:47:36,536 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:47:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1004 transitions. [2025-02-06 09:47:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 09:47:36,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:36,539 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:47:36,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:47:36,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:36,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash -584434244, now seen corresponding path program 1 times [2025-02-06 09:47:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:36,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279263119] [2025-02-06 09:47:36,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:36,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:36,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:47:36,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:47:36,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:36,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:37,118 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:47:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:37,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279263119] [2025-02-06 09:47:37,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279263119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:37,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:47:37,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:47:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370703481] [2025-02-06 09:47:37,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:37,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:47:37,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:37,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:47:37,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:47:37,126 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:47:37,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:37,360 INFO L93 Difference]: Finished difference Result 650 states and 927 transitions. [2025-02-06 09:47:37,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:47:37,361 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:47:37,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:37,367 INFO L225 Difference]: With dead ends: 650 [2025-02-06 09:47:37,367 INFO L226 Difference]: Without dead ends: 650 [2025-02-06 09:47:37,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:47:37,369 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 30 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:37,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1959 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:47:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-06 09:47:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2025-02-06 09:47:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 633 states have (on average 1.4265402843601895) internal successors, (903), 640 states have internal predecessors, (903), 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:47:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 927 transitions. [2025-02-06 09:47:37,409 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 927 transitions. Word has length 221 [2025-02-06 09:47:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:37,410 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 927 transitions. [2025-02-06 09:47:37,410 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:47:37,410 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 927 transitions. [2025-02-06 09:47:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 09:47:37,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:37,416 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:47:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:47:37,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:37,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2088596604, now seen corresponding path program 1 times [2025-02-06 09:47:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122221959] [2025-02-06 09:47:37,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:37,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:47:37,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:47:37,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:37,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:37,777 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:47:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122221959] [2025-02-06 09:47:37,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122221959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:37,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:47:37,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:47:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889245267] [2025-02-06 09:47:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:37,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:47:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:37,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:47:37,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:47:37,783 INFO L87 Difference]: Start difference. First operand 650 states and 927 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:47:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:37,932 INFO L93 Difference]: Finished difference Result 650 states and 924 transitions. [2025-02-06 09:47:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:47:37,934 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:47:37,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:37,937 INFO L225 Difference]: With dead ends: 650 [2025-02-06 09:47:37,939 INFO L226 Difference]: Without dead ends: 650 [2025-02-06 09:47:37,939 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:47:37,940 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 1 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:37,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1322 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 09:47:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-06 09:47:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2025-02-06 09:47:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 633 states have (on average 1.4218009478672986) internal successors, (900), 640 states have internal predecessors, (900), 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:47:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 924 transitions. [2025-02-06 09:47:37,959 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 924 transitions. Word has length 221 [2025-02-06 09:47:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:37,959 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 924 transitions. [2025-02-06 09:47:37,960 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:47:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 924 transitions. [2025-02-06 09:47:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-06 09:47:37,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:37,963 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:47:37,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:47:37,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:37,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:37,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1649109570, now seen corresponding path program 1 times [2025-02-06 09:47:37,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:37,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410763520] [2025-02-06 09:47:37,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:37,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:38,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-06 09:47:38,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-06 09:47:38,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:38,341 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:47:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:38,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410763520] [2025-02-06 09:47:38,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410763520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:38,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:47:38,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:47:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528093078] [2025-02-06 09:47:38,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:38,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:47:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:38,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:47:38,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:47:38,346 INFO L87 Difference]: Start difference. First operand 650 states and 924 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:47:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:38,558 INFO L93 Difference]: Finished difference Result 941 states and 1340 transitions. [2025-02-06 09:47:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:47:38,559 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:47:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:38,564 INFO L225 Difference]: With dead ends: 941 [2025-02-06 09:47:38,564 INFO L226 Difference]: Without dead ends: 941 [2025-02-06 09:47:38,565 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:47:38,566 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 454 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:38,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1516 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:47:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-02-06 09:47:38,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 938. [2025-02-06 09:47:38,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 913 states have (on average 1.4216867469879517) internal successors, (1298), 925 states have internal predecessors, (1298), 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:47:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1338 transitions. [2025-02-06 09:47:38,597 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1338 transitions. Word has length 221 [2025-02-06 09:47:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:38,598 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1338 transitions. [2025-02-06 09:47:38,598 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:47:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1338 transitions. [2025-02-06 09:47:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-06 09:47:38,602 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:38,602 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:47:38,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:47:38,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:38,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:38,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1471635911, now seen corresponding path program 1 times [2025-02-06 09:47:38,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:38,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740666949] [2025-02-06 09:47:38,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:38,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:38,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:47:38,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:47:38,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:38,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:39,075 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:47:39,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740666949] [2025-02-06 09:47:39,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740666949] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:47:39,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243362212] [2025-02-06 09:47:39,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:39,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:47:39,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:47:39,079 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:47:39,082 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:47:39,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:47:39,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:47:39,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:39,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:39,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:47:39,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:47:39,757 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:47:39,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:47:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243362212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:39,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:47:39,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-06 09:47:39,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675329880] [2025-02-06 09:47:39,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:39,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:47:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:39,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:47:39,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:47:39,760 INFO L87 Difference]: Start difference. First operand 938 states and 1338 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:47:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:39,946 INFO L93 Difference]: Finished difference Result 978 states and 1378 transitions. [2025-02-06 09:47:39,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:47:39,946 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:47:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:39,951 INFO L225 Difference]: With dead ends: 978 [2025-02-06 09:47:39,952 INFO L226 Difference]: Without dead ends: 978 [2025-02-06 09:47:39,952 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:47:39,953 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 8 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:39,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1301 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:47:39,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-02-06 09:47:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2025-02-06 09:47:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 953 states have (on average 1.40398740818468) internal successors, (1338), 965 states have internal predecessors, (1338), 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:47:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1378 transitions. [2025-02-06 09:47:39,984 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1378 transitions. Word has length 236 [2025-02-06 09:47:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:39,985 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1378 transitions. [2025-02-06 09:47:39,985 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:47:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1378 transitions. [2025-02-06 09:47:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-06 09:47:39,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:39,990 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:47:40,002 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:47:40,190 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:47:40,191 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:40,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1347562664, now seen corresponding path program 1 times [2025-02-06 09:47:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484793544] [2025-02-06 09:47:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:40,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:47:40,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:47:40,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:40,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:40,674 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:47:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484793544] [2025-02-06 09:47:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484793544] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:47:40,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203727304] [2025-02-06 09:47:40,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:40,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:47:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:47:40,677 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:47:40,680 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:47:41,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:47:41,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:47:41,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:41,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:41,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:47:41,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:47:41,314 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:47:41,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 09:47:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203727304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:47:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 09:47:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 09:47:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262245922] [2025-02-06 09:47:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:47:41,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:47:41,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:41,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:47:41,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:47:41,319 INFO L87 Difference]: Start difference. First operand 978 states and 1378 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:47:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:41,500 INFO L93 Difference]: Finished difference Result 950 states and 1336 transitions. [2025-02-06 09:47:41,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 09:47:41,502 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:47:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:41,508 INFO L225 Difference]: With dead ends: 950 [2025-02-06 09:47:41,508 INFO L226 Difference]: Without dead ends: 950 [2025-02-06 09:47:41,509 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:47:41,509 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 105 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:41,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1869 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 09:47:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2025-02-06 09:47:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2025-02-06 09:47:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 925 states have (on average 1.401081081081081) internal successors, (1296), 937 states have internal predecessors, (1296), 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:47:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1336 transitions. [2025-02-06 09:47:41,536 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1336 transitions. Word has length 236 [2025-02-06 09:47:41,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:41,537 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1336 transitions. [2025-02-06 09:47:41,537 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:47:41,537 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1336 transitions. [2025-02-06 09:47:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-02-06 09:47:41,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:41,541 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:47:41,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 09:47:41,741 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:47:41,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:41,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1199815105, now seen corresponding path program 1 times [2025-02-06 09:47:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:41,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629528819] [2025-02-06 09:47:41,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:41,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:47:41,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:47:41,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:41,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:42,083 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:47:42,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629528819] [2025-02-06 09:47:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629528819] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:47:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460751402] [2025-02-06 09:47:42,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:47:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:47:42,088 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:47:42,089 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:47:42,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-02-06 09:47:42,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-02-06 09:47:42,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:42,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:42,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 09:47:42,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:47:42,934 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:47:42,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:47:43,191 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:47:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460751402] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:47:43,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:47:43,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 09:47:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534334863] [2025-02-06 09:47:43,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:47:43,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 09:47:43,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:43,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 09:47:43,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 09:47:43,195 INFO L87 Difference]: Start difference. First operand 950 states and 1336 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:47:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:43,638 INFO L93 Difference]: Finished difference Result 2198 states and 3101 transitions. [2025-02-06 09:47:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:47:43,638 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:47:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:43,649 INFO L225 Difference]: With dead ends: 2198 [2025-02-06 09:47:43,649 INFO L226 Difference]: Without dead ends: 2198 [2025-02-06 09:47:43,650 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:47:43,651 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 3013 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3044 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:43,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3044 Valid, 2670 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 09:47:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2025-02-06 09:47:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1877. [2025-02-06 09:47:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1877 states, 1827 states have (on average 1.3908045977011494) internal successors, (2541), 1849 states have internal predecessors, (2541), 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:47:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2631 transitions. [2025-02-06 09:47:43,709 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 2631 transitions. Word has length 236 [2025-02-06 09:47:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:43,710 INFO L471 AbstractCegarLoop]: Abstraction has 1877 states and 2631 transitions. [2025-02-06 09:47:43,710 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:47:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 2631 transitions. [2025-02-06 09:47:43,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2025-02-06 09:47:43,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:43,725 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:47:43,737 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:47:43,926 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:47:43,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:43,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash 875244661, now seen corresponding path program 1 times [2025-02-06 09:47:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:43,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107921264] [2025-02-06 09:47:43,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:44,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-02-06 09:47:44,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-02-06 09:47:44,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:44,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:44,985 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:47:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:47:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107921264] [2025-02-06 09:47:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107921264] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:47:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630663190] [2025-02-06 09:47:44,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:44,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:47:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:47:44,988 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:47:44,990 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:47:45,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 668 statements into 1 equivalence classes. [2025-02-06 09:47:46,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 668 of 668 statements. [2025-02-06 09:47:46,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:47:46,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:47:46,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 3260 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:47:46,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:47:46,872 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:47:46,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:47:47,645 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:47:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630663190] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:47:47,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:47:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-02-06 09:47:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016027561] [2025-02-06 09:47:47,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:47:47,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 09:47:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:47:47,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 09:47:47,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-06 09:47:47,650 INFO L87 Difference]: Start difference. First operand 1877 states and 2631 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:47:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 09:47:52,814 INFO L93 Difference]: Finished difference Result 4344 states and 6073 transitions. [2025-02-06 09:47:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 09:47:52,815 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:47:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 09:47:52,834 INFO L225 Difference]: With dead ends: 4344 [2025-02-06 09:47:52,835 INFO L226 Difference]: Without dead ends: 4344 [2025-02-06 09:47:52,836 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:47:52,838 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 16049 mSDsluCounter, 5145 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16049 SdHoareTripleChecker+Valid, 6099 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-06 09:47:52,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16049 Valid, 6099 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-06 09:47:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states. [2025-02-06 09:47:52,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 4169. [2025-02-06 09:47:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4096 states have (on average 1.3876953125) internal successors, (5684), 4123 states have internal predecessors, (5684), 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:47:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5820 transitions. [2025-02-06 09:47:52,951 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5820 transitions. Word has length 668 [2025-02-06 09:47:52,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 09:47:52,953 INFO L471 AbstractCegarLoop]: Abstraction has 4169 states and 5820 transitions. [2025-02-06 09:47:52,953 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:47:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5820 transitions. [2025-02-06 09:47:53,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1543 [2025-02-06 09:47:53,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 09:47:53,032 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:47:53,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 09:47:53,236 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:47:53,237 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 09:47:53,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:47:53,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1107687281, now seen corresponding path program 1 times [2025-02-06 09:47:53,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:47:53,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079807395] [2025-02-06 09:47:53,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:47:53,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:47:53,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1542 statements into 1 equivalence classes.