./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:09:01,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:09:01,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-04 07:09:01,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:09:01,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:09:02,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:09:02,019 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:09:02,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:09:02,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:09:02,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:09:02,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:09:02,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:09:02,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:09:02,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:09:02,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:09:02,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:09:02,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 07:09:02,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:09:02,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:09:02,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:09:02,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:09:02,023 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:09:02,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:09:02,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:09:02,023 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/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 -> c2bc72e0ba847f7c079e01dc4ce9f95afa555e9d2ef7b4bcdf5e1274db86053e [2025-03-04 07:09:02,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:09:02,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:09:02,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:09:02,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:09:02,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:09:02,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2025-03-04 07:09:03,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889016e5f/67da584a5c064b2c9adac76d64e61470/FLAG25975a8ea [2025-03-04 07:09:03,793 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:09:03,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-1.i [2025-03-04 07:09:03,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889016e5f/67da584a5c064b2c9adac76d64e61470/FLAG25975a8ea [2025-03-04 07:09:03,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/889016e5f/67da584a5c064b2c9adac76d64e61470 [2025-03-04 07:09:03,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:09:03,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:09:03,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:09:03,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:09:03,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:09:03,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:09:03" (1/1) ... [2025-03-04 07:09:03,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7c3dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:03, skipping insertion in model container [2025-03-04 07:09:03,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:09:03" (1/1) ... [2025-03-04 07:09:03,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:09:04,197 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,227 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,233 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,235 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,241 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,279 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,279 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,283 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,283 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 07:09:04,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:09:04,301 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:09:04,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:09:04,405 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:09:04,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04 WrapperNode [2025-03-04 07:09:04,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:09:04,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:09:04,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:09:04,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:09:04,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,475 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1264 [2025-03-04 07:09:04,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:09:04,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:09:04,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:09:04,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:09:04,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,537 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2025-03-04 07:09:04,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,578 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:09:04,594 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:09:04,594 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:09:04,594 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:09:04,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (1/1) ... [2025-03-04 07:09:04,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:09:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:04,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:09:04,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:09:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 07:09:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 07:09:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 07:09:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 07:09:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 07:09:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 07:09:04,643 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 07:09:04,644 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 07:09:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:09:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 07:09:04,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:09:04,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:09:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:09:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:09:04,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:09:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:09:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:09:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:09:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:09:04,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:09:04,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:09:04,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:09:04,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:09:05,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 07:09:06,006 INFO L? ?]: Removed 304 outVars from TransFormulas that were not future-live. [2025-03-04 07:09:06,006 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:09:06,042 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:09:06,044 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 07:09:06,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:09:06 BoogieIcfgContainer [2025-03-04 07:09:06,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:09:06,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:09:06,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:09:06,050 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:09:06,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:09:03" (1/3) ... [2025-03-04 07:09:06,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4292fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:09:06, skipping insertion in model container [2025-03-04 07:09:06,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:09:04" (2/3) ... [2025-03-04 07:09:06,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f4292fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:09:06, skipping insertion in model container [2025-03-04 07:09:06,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:09:06" (3/3) ... [2025-03-04 07:09:06,052 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-1.i [2025-03-04 07:09:06,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:09:06,062 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test2-1.i that has 6 procedures, 388 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2025-03-04 07:09:06,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:09:06,099 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;@2d765eae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:09:06,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 07:09:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 380 states, 364 states have (on average 1.620879120879121) internal successors, (590), 373 states have internal predecessors, (590), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 07:09:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 07:09:06,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:06,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:06,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:06,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:06,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1988809201, now seen corresponding path program 1 times [2025-03-04 07:09:06,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:06,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685396947] [2025-03-04 07:09:06,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:06,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:06,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 07:09:06,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 07:09:06,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:06,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:09:06,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685396947] [2025-03-04 07:09:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685396947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:06,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:06,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:09:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865691920] [2025-03-04 07:09:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:06,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 07:09:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:06,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 07:09:06,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:09:06,257 INFO L87 Difference]: Start difference. First operand has 380 states, 364 states have (on average 1.620879120879121) internal successors, (590), 373 states have internal predecessors, (590), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:09:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:06,383 INFO L93 Difference]: Finished difference Result 378 states and 551 transitions. [2025-03-04 07:09:06,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 07:09:06,385 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 07:09:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:06,391 INFO L225 Difference]: With dead ends: 378 [2025-03-04 07:09:06,393 INFO L226 Difference]: Without dead ends: 376 [2025-03-04 07:09:06,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 07:09:06,399 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:06,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 510 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:09:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-04 07:09:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2025-03-04 07:09:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 362 states have (on average 1.4668508287292819) internal successors, (531), 369 states have internal predecessors, (531), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:09:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 549 transitions. [2025-03-04 07:09:06,449 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 549 transitions. Word has length 7 [2025-03-04 07:09:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:06,450 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 549 transitions. [2025-03-04 07:09:06,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:09:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 549 transitions. [2025-03-04 07:09:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:09:06,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:06,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:06,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:09:06,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:06,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash 52426882, now seen corresponding path program 1 times [2025-03-04 07:09:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:06,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055105996] [2025-03-04 07:09:06,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:06,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:09:06,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:09:06,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:06,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:09:06,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:06,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055105996] [2025-03-04 07:09:06,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055105996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:06,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:06,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:09:06,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026037114] [2025-03-04 07:09:06,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:06,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:09:06,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:06,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:09:06,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:09:06,611 INFO L87 Difference]: Start difference. First operand 376 states and 549 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03-04 07:09:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:06,856 INFO L93 Difference]: Finished difference Result 735 states and 1082 transitions. [2025-03-04 07:09:06,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:09:06,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-04 07:09:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:06,862 INFO L225 Difference]: With dead ends: 735 [2025-03-04 07:09:06,862 INFO L226 Difference]: Without dead ends: 735 [2025-03-04 07:09:06,863 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-03-04 07:09:06,863 INFO L435 NwaCegarLoop]: 489 mSDtfsCounter, 513 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:06,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1454 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:09:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-04 07:09:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 378. [2025-03-04 07:09:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 364 states have (on average 1.4642857142857142) internal successors, (533), 371 states have internal predecessors, (533), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:09:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 551 transitions. [2025-03-04 07:09:06,885 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 551 transitions. Word has length 9 [2025-03-04 07:09:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:06,886 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 551 transitions. [2025-03-04 07:09:06,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03-04 07:09:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 551 transitions. [2025-03-04 07:09:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 07:09:06,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:06,888 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:06,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:09:06,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:06,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash 443517085, now seen corresponding path program 1 times [2025-03-04 07:09:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:06,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814846542] [2025-03-04 07:09:06,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:06,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 07:09:06,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 07:09:06,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:06,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:09:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814846542] [2025-03-04 07:09:07,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814846542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:07,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:07,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:09:07,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079441295] [2025-03-04 07:09:07,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:07,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:09:07,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:07,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:09:07,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:09:07,290 INFO L87 Difference]: Start difference. First operand 378 states and 551 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 07:09:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:07,426 INFO L93 Difference]: Finished difference Result 336 states and 474 transitions. [2025-03-04 07:09:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:09:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-03-04 07:09:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:07,428 INFO L225 Difference]: With dead ends: 336 [2025-03-04 07:09:07,428 INFO L226 Difference]: Without dead ends: 336 [2025-03-04 07:09:07,428 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-03-04 07:09:07,428 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 30 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:07,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1229 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:09:07,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-03-04 07:09:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2025-03-04 07:09:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 322 states have (on average 1.4161490683229814) internal successors, (456), 329 states have internal predecessors, (456), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:09:07,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 474 transitions. [2025-03-04 07:09:07,438 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 474 transitions. Word has length 83 [2025-03-04 07:09:07,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:07,438 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 474 transitions. [2025-03-04 07:09:07,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-03-04 07:09:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 474 transitions. [2025-03-04 07:09:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 07:09:07,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:07,440 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:07,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:09:07,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:07,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 155750198, now seen corresponding path program 1 times [2025-03-04 07:09:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:07,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116708809] [2025-03-04 07:09:07,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:07,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 07:09:07,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 07:09:07,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:07,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:09:07,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116708809] [2025-03-04 07:09:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116708809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:09:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888751757] [2025-03-04 07:09:07,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:07,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:09:07,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:07,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:09:07,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:09:07,638 INFO L87 Difference]: Start difference. First operand 336 states and 474 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-03-04 07:09:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:07,772 INFO L93 Difference]: Finished difference Result 569 states and 815 transitions. [2025-03-04 07:09:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:09:07,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83 [2025-03-04 07:09:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:07,775 INFO L225 Difference]: With dead ends: 569 [2025-03-04 07:09:07,776 INFO L226 Difference]: Without dead ends: 569 [2025-03-04 07:09:07,776 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-03-04 07:09:07,776 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 271 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:07,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1032 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:09:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-04 07:09:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 565. [2025-03-04 07:09:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 546 states have (on average 1.435897435897436) internal successors, (784), 558 states have internal predecessors, (784), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:09:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 812 transitions. [2025-03-04 07:09:07,797 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 812 transitions. Word has length 83 [2025-03-04 07:09:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:07,798 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 812 transitions. [2025-03-04 07:09:07,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-03-04 07:09:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 812 transitions. [2025-03-04 07:09:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 07:09:07,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:07,803 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:07,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:09:07,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:07,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 431487777, now seen corresponding path program 1 times [2025-03-04 07:09:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:07,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499102034] [2025-03-04 07:09:07,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:07,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 07:09:07,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 07:09:07,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:07,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:09:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499102034] [2025-03-04 07:09:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499102034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:09:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791182326] [2025-03-04 07:09:08,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:08,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:09:08,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:09:08,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:09:08,177 INFO L87 Difference]: Start difference. First operand 565 states and 812 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:09:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:08,360 INFO L93 Difference]: Finished difference Result 809 states and 1173 transitions. [2025-03-04 07:09:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:09:08,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-03-04 07:09:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:08,364 INFO L225 Difference]: With dead ends: 809 [2025-03-04 07:09:08,364 INFO L226 Difference]: Without dead ends: 809 [2025-03-04 07:09:08,364 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-03-04 07:09:08,366 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 426 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:08,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1234 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:09:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-04 07:09:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 567. [2025-03-04 07:09:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 548 states have (on average 1.4343065693430657) internal successors, (786), 560 states have internal predecessors, (786), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:09:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 814 transitions. [2025-03-04 07:09:08,384 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 814 transitions. Word has length 98 [2025-03-04 07:09:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:08,384 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 814 transitions. [2025-03-04 07:09:08,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:09:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 814 transitions. [2025-03-04 07:09:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 07:09:08,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:08,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:09:08,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:08,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash 308056077, now seen corresponding path program 1 times [2025-03-04 07:09:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262811179] [2025-03-04 07:09:08,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:08,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 07:09:08,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 07:09:08,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:08,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:08,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:09:08,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262811179] [2025-03-04 07:09:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262811179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:08,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:09:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738495542] [2025-03-04 07:09:08,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:08,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:09:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:08,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:09:08,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:09:08,597 INFO L87 Difference]: Start difference. First operand 567 states and 814 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-03-04 07:09:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:08,690 INFO L93 Difference]: Finished difference Result 607 states and 854 transitions. [2025-03-04 07:09:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:09:08,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 153 [2025-03-04 07:09:08,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:08,693 INFO L225 Difference]: With dead ends: 607 [2025-03-04 07:09:08,694 INFO L226 Difference]: Without dead ends: 607 [2025-03-04 07:09:08,694 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-03-04 07:09:08,695 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 8 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:08,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 813 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:09:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-04 07:09:08,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2025-03-04 07:09:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 588 states have (on average 1.4047619047619047) internal successors, (826), 600 states have internal predecessors, (826), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:09:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 854 transitions. [2025-03-04 07:09:08,711 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 854 transitions. Word has length 153 [2025-03-04 07:09:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:08,712 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 854 transitions. [2025-03-04 07:09:08,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-03-04 07:09:08,712 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 854 transitions. [2025-03-04 07:09:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 07:09:08,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:08,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:08,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:09:08,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash 183982830, now seen corresponding path program 1 times [2025-03-04 07:09:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164129507] [2025-03-04 07:09:08,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:08,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 07:09:08,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 07:09:08,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:08,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 07:09:08,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:08,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164129507] [2025-03-04 07:09:08,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164129507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:08,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:08,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:09:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948695764] [2025-03-04 07:09:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:08,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:09:08,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:08,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:09:08,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:09:08,932 INFO L87 Difference]: Start difference. First operand 607 states and 854 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-03-04 07:09:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:09,033 INFO L93 Difference]: Finished difference Result 483 states and 654 transitions. [2025-03-04 07:09:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:09:09,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 153 [2025-03-04 07:09:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:09,036 INFO L225 Difference]: With dead ends: 483 [2025-03-04 07:09:09,036 INFO L226 Difference]: Without dead ends: 483 [2025-03-04 07:09:09,036 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-03-04 07:09:09,036 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 32 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:09,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1003 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:09:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-03-04 07:09:09,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2025-03-04 07:09:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 464 states have (on average 1.3491379310344827) internal successors, (626), 476 states have internal predecessors, (626), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 07:09:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 654 transitions. [2025-03-04 07:09:09,053 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 654 transitions. Word has length 153 [2025-03-04 07:09:09,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:09,054 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 654 transitions. [2025-03-04 07:09:09,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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-03-04 07:09:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 654 transitions. [2025-03-04 07:09:09,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 07:09:09,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:09,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:09:09,058 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash 36235271, now seen corresponding path program 1 times [2025-03-04 07:09:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:09,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733457828] [2025-03-04 07:09:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:09,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 07:09:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 07:09:09,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:09,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:09:09,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:09,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733457828] [2025-03-04 07:09:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733457828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:09,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:09,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:09:09,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803669419] [2025-03-04 07:09:09,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:09,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:09:09,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:09,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:09:09,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:09:09,283 INFO L87 Difference]: Start difference. First operand 483 states and 654 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-03-04 07:09:09,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:09,557 INFO L93 Difference]: Finished difference Result 565 states and 760 transitions. [2025-03-04 07:09:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:09:09,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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 153 [2025-03-04 07:09:09,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:09,559 INFO L225 Difference]: With dead ends: 565 [2025-03-04 07:09:09,559 INFO L226 Difference]: Without dead ends: 565 [2025-03-04 07:09:09,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:09:09,560 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 1179 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:09,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 857 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:09:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-03-04 07:09:09,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 381. [2025-03-04 07:09:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 367 states have (on average 1.340599455040872) internal successors, (492), 374 states have internal predecessors, (492), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 07:09:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 510 transitions. [2025-03-04 07:09:09,570 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 510 transitions. Word has length 153 [2025-03-04 07:09:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:09,570 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 510 transitions. [2025-03-04 07:09:09,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 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-03-04 07:09:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 510 transitions. [2025-03-04 07:09:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 07:09:09,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:09,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:09:09,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:09:09,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:09,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1401457209, now seen corresponding path program 1 times [2025-03-04 07:09:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442249727] [2025-03-04 07:09:09,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:09,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 07:09:09,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 07:09:09,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:09,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:09:10,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442249727] [2025-03-04 07:09:10,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442249727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:09:10,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774139972] [2025-03-04 07:09:10,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:10,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:10,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:10,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:09:10,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:09:10,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 07:09:10,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 07:09:10,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:10,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:10,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:09:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:10,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:09:10,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:09:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:09:10,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:09:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:09:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774139972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:09:10,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:09:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2025-03-04 07:09:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640323998] [2025-03-04 07:09:10,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:09:10,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 07:09:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:10,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 07:09:10,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:09:10,869 INFO L87 Difference]: Start difference. First operand 381 states and 510 transitions. Second operand has 12 states, 12 states have (on average 26.666666666666668) internal successors, (320), 12 states have internal predecessors, (320), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:09:11,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:11,305 INFO L93 Difference]: Finished difference Result 1115 states and 1503 transitions. [2025-03-04 07:09:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:09:11,306 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 26.666666666666668) internal successors, (320), 12 states have internal predecessors, (320), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 163 [2025-03-04 07:09:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:11,309 INFO L225 Difference]: With dead ends: 1115 [2025-03-04 07:09:11,309 INFO L226 Difference]: Without dead ends: 1115 [2025-03-04 07:09:11,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 318 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:09:11,310 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 1277 mSDsluCounter, 3246 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 3749 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:11,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 3749 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:09:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-04 07:09:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 721. [2025-03-04 07:09:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 703 states have (on average 1.3399715504978662) internal successors, (942), 710 states have internal predecessors, (942), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 07:09:11,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 966 transitions. [2025-03-04 07:09:11,327 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 966 transitions. Word has length 163 [2025-03-04 07:09:11,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:11,327 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 966 transitions. [2025-03-04 07:09:11,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.666666666666668) internal successors, (320), 12 states have internal predecessors, (320), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:09:11,328 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 966 transitions. [2025-03-04 07:09:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-04 07:09:11,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:11,332 INFO L218 NwaCegarLoop]: trace histogram [5, 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, 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] [2025-03-04 07:09:11,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:09:11,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:11,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:11,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:11,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1239833821, now seen corresponding path program 1 times [2025-03-04 07:09:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701971267] [2025-03-04 07:09:11,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:11,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-04 07:09:11,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-04 07:09:11,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:11,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:09:13,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:13,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701971267] [2025-03-04 07:09:13,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701971267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:09:13,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135920041] [2025-03-04 07:09:13,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:13,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:09:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:09:13,948 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:09:13,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:09:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-04 07:09:14,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-04 07:09:14,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:14,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:14,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 07:09:14,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:09:14,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:09:14,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:09:14,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:09:14,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:09:15,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-04 07:09:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:09:15,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:09:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 446 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:09:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135920041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:09:15,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:09:15,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 23 [2025-03-04 07:09:15,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609597704] [2025-03-04 07:09:15,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:09:15,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:09:15,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:15,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:09:15,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:09:15,501 INFO L87 Difference]: Start difference. First operand 721 states and 966 transitions. Second operand has 23 states, 23 states have (on average 42.869565217391305) internal successors, (986), 23 states have internal predecessors, (986), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:09:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:16,695 INFO L93 Difference]: Finished difference Result 2336 states and 3162 transitions. [2025-03-04 07:09:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:09:16,696 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 42.869565217391305) internal successors, (986), 23 states have internal predecessors, (986), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 385 [2025-03-04 07:09:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:16,703 INFO L225 Difference]: With dead ends: 2336 [2025-03-04 07:09:16,703 INFO L226 Difference]: Without dead ends: 2336 [2025-03-04 07:09:16,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 758 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:09:16,704 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 3997 mSDsluCounter, 11994 mSDsCounter, 0 mSdLazyCounter, 1745 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4032 SdHoareTripleChecker+Valid, 13301 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:16,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4032 Valid, 13301 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1745 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 07:09:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2025-03-04 07:09:16,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 1567. [2025-03-04 07:09:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1543 states have (on average 1.3415424497731692) internal successors, (2070), 1550 states have internal predecessors, (2070), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 07:09:16,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2106 transitions. [2025-03-04 07:09:16,734 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2106 transitions. Word has length 385 [2025-03-04 07:09:16,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:16,735 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2106 transitions. [2025-03-04 07:09:16,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 42.869565217391305) internal successors, (986), 23 states have internal predecessors, (986), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 07:09:16,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2106 transitions. [2025-03-04 07:09:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 830 [2025-03-04 07:09:16,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:16,747 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-03-04 07:09:16,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:09:16,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 07:09:16,948 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:16,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash 317881637, now seen corresponding path program 2 times [2025-03-04 07:09:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:16,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835380796] [2025-03-04 07:09:16,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:09:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:17,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 829 statements into 2 equivalence classes. [2025-03-04 07:09:17,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 74 of 829 statements. [2025-03-04 07:09:17,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:09:17,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-04 07:09:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835380796] [2025-03-04 07:09:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835380796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:09:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900754210] [2025-03-04 07:09:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:17,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:09:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:09:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:09:17,262 INFO L87 Difference]: Start difference. First operand 1567 states and 2106 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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-03-04 07:09:17,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:17,550 INFO L93 Difference]: Finished difference Result 1607 states and 2161 transitions. [2025-03-04 07:09:17,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:09:17,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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 829 [2025-03-04 07:09:17,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:17,557 INFO L225 Difference]: With dead ends: 1607 [2025-03-04 07:09:17,558 INFO L226 Difference]: Without dead ends: 1607 [2025-03-04 07:09:17,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:09:17,560 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 80 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:17,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1582 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:09:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-03-04 07:09:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1569. [2025-03-04 07:09:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1545 states have (on average 1.3411003236245955) internal successors, (2072), 1552 states have internal predecessors, (2072), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 07:09:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2108 transitions. [2025-03-04 07:09:17,611 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2108 transitions. Word has length 829 [2025-03-04 07:09:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:17,612 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2108 transitions. [2025-03-04 07:09:17,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 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-03-04 07:09:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2108 transitions. [2025-03-04 07:09:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2025-03-04 07:09:17,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:17,626 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-03-04 07:09:17,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:09:17,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:17,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:17,628 INFO L85 PathProgramCache]: Analyzing trace with hash -513819781, now seen corresponding path program 1 times [2025-03-04 07:09:17,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:17,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368986635] [2025-03-04 07:09:17,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:17,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:17,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-04 07:09:18,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-04 07:09:18,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:18,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-04 07:09:19,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368986635] [2025-03-04 07:09:19,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368986635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:19,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:19,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:09:19,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509514659] [2025-03-04 07:09:19,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:19,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:09:19,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:19,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:09:19,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:09:19,475 INFO L87 Difference]: Start difference. First operand 1569 states and 2108 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-03-04 07:09:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:19,745 INFO L93 Difference]: Finished difference Result 1574 states and 2114 transitions. [2025-03-04 07:09:19,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:09:19,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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 830 [2025-03-04 07:09:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:19,752 INFO L225 Difference]: With dead ends: 1574 [2025-03-04 07:09:19,752 INFO L226 Difference]: Without dead ends: 1574 [2025-03-04 07:09:19,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:09:19,753 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 14 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:19,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1467 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:09:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2025-03-04 07:09:19,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1573. [2025-03-04 07:09:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1549 states have (on average 1.340865074241446) internal successors, (2077), 1556 states have internal predecessors, (2077), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 07:09:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2113 transitions. [2025-03-04 07:09:19,783 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2113 transitions. Word has length 830 [2025-03-04 07:09:19,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:19,784 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2113 transitions. [2025-03-04 07:09:19,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 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-03-04 07:09:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2113 transitions. [2025-03-04 07:09:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2025-03-04 07:09:19,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:19,796 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-03-04 07:09:19,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 07:09:19,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:19,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash -823807668, now seen corresponding path program 1 times [2025-03-04 07:09:19,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:19,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732278125] [2025-03-04 07:09:19,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:19,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:20,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 831 statements into 1 equivalence classes. [2025-03-04 07:09:20,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 831 of 831 statements. [2025-03-04 07:09:20,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:09:20,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:09:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3336 trivial. 0 not checked. [2025-03-04 07:09:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:09:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732278125] [2025-03-04 07:09:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732278125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:09:21,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:09:21,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:09:21,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103360948] [2025-03-04 07:09:21,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:09:21,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:09:21,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:09:21,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:09:21,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:09:21,658 INFO L87 Difference]: Start difference. First operand 1573 states and 2113 transitions. Second operand has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-03-04 07:09:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:09:22,077 INFO L93 Difference]: Finished difference Result 1584 states and 2126 transitions. [2025-03-04 07:09:22,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:09:22,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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 831 [2025-03-04 07:09:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:09:22,082 INFO L225 Difference]: With dead ends: 1584 [2025-03-04 07:09:22,082 INFO L226 Difference]: Without dead ends: 1584 [2025-03-04 07:09:22,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:09:22,083 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 31 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:09:22,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2408 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:09:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2025-03-04 07:09:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1581. [2025-03-04 07:09:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1557 states have (on average 1.3397559409120103) internal successors, (2086), 1564 states have internal predecessors, (2086), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (17), 13 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 07:09:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2122 transitions. [2025-03-04 07:09:22,109 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2122 transitions. Word has length 831 [2025-03-04 07:09:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:09:22,110 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2122 transitions. [2025-03-04 07:09:22,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.666666666666668) internal successors, (159), 9 states have internal predecessors, (159), 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-03-04 07:09:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2122 transitions. [2025-03-04 07:09:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2025-03-04 07:09:22,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:09:22,116 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 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] [2025-03-04 07:09:22,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:09:22,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 07:09:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:09:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash -686816043, now seen corresponding path program 1 times [2025-03-04 07:09:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:09:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791551878] [2025-03-04 07:09:22,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:09:22,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:09:22,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 832 statements into 1 equivalence classes.