./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8fc3dc66 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_BER_nondet_test1-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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:23:04,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:23:04,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-03-17 11:23:04,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:23:04,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:23:04,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:23:04,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:23:04,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:23:04,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:23:04,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:23:04,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:23:04,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:23:04,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:23:04,900 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:23:04,900 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:23:04,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:23:04,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:23:04,900 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:23:04,901 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:23:04,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:23:04,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:23:04,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:23:04,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:23:04,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:23:04,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:23:04,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:23:04,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:23:04,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:23:04,902 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-17 11:23:05,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:23:05,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:23:05,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:23:05,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:23:05,161 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:23:05,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2025-03-17 11:23:06,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3710b3f/eee876974ca64a28ac445dfbd3380202/FLAGa7641edcf [2025-03-17 11:23:06,591 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:23:06,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test1-1.i [2025-03-17 11:23:06,607 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3710b3f/eee876974ca64a28ac445dfbd3380202/FLAGa7641edcf [2025-03-17 11:23:06,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c3710b3f/eee876974ca64a28ac445dfbd3380202 [2025-03-17 11:23:06,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:23:06,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:23:06,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:23:06,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:23:06,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:23:06,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:23:06" (1/1) ... [2025-03-17 11:23:06,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755a91b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:06, skipping insertion in model container [2025-03-17 11:23:06,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:23:06" (1/1) ... [2025-03-17 11:23:06,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:23:06,944 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-17 11:23:06,974 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-17 11:23:06,978 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-17 11:23:06,983 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-17 11:23:06,990 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-17 11:23:07,001 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-17 11:23:07,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:23:07,015 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:23:07,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:23:07,101 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:23:07,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07 WrapperNode [2025-03-17 11:23:07,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:23:07,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:23:07,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:23:07,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:23:07,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,151 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 773 [2025-03-17 11:23:07,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:23:07,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:23:07,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:23:07,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:23:07,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,199 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-17 11:23:07,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:23:07,244 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:23:07,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:23:07,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:23:07,245 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (1/1) ... [2025-03-17 11:23:07,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:23:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:23:07,276 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-17 11:23:07,282 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-17 11:23:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 11:23:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 11:23:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:23:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:23:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 11:23:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 11:23:07,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 11:23:07,297 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:23:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:23:07,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:23:07,442 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:23:07,443 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:23:08,206 INFO L? ?]: Removed 196 outVars from TransFormulas that were not future-live. [2025-03-17 11:23:08,206 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:23:08,228 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:23:08,229 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 11:23:08,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:23:08 BoogieIcfgContainer [2025-03-17 11:23:08,229 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:23:08,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:23:08,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:23:08,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:23:08,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:23:06" (1/3) ... [2025-03-17 11:23:08,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d60dada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:23:08, skipping insertion in model container [2025-03-17 11:23:08,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:23:07" (2/3) ... [2025-03-17 11:23:08,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d60dada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:23:08, skipping insertion in model container [2025-03-17 11:23:08,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:23:08" (3/3) ... [2025-03-17 11:23:08,235 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test1-1.i [2025-03-17 11:23:08,243 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:23:08,244 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_nondet_test1-1.i that has 3 procedures, 211 locations, 1 initial locations, 19 loop locations, and 2 error locations. [2025-03-17 11:23:08,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:23:08,278 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;@32b84382, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:23:08,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 11:23:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 200 states have (on average 1.61) internal successors, (322), 202 states have internal predecessors, (322), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:23:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 11:23:08,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:23:08,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 11:23:08,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:23:08,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:23:08,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1929543694, now seen corresponding path program 1 times [2025-03-17 11:23:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:23:08,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465496430] [2025-03-17 11:23:08,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:23:08,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 11:23:08,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 11:23:08,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:23:08,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:23:08,435 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-17 11:23:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:23:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465496430] [2025-03-17 11:23:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465496430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:23:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:23:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:23:08,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607592607] [2025-03-17 11:23:08,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:23:08,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:23:08,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:23:08,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:23:08,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:23:08,465 INFO L87 Difference]: Start difference. First operand has 207 states, 200 states have (on average 1.61) internal successors, (322), 202 states have internal predecessors, (322), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:23:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:23:08,600 INFO L93 Difference]: Finished difference Result 397 states and 572 transitions. [2025-03-17 11:23:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:23:08,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 11:23:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:23:08,613 INFO L225 Difference]: With dead ends: 397 [2025-03-17 11:23:08,614 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 11:23:08,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:23:08,619 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 271 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:23:08,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 535 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:23:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 11:23:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 205. [2025-03-17 11:23:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 199 states have (on average 1.4422110552763818) internal successors, (287), 200 states have internal predecessors, (287), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:23:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 293 transitions. [2025-03-17 11:23:08,658 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 293 transitions. Word has length 6 [2025-03-17 11:23:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:23:08,659 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 293 transitions. [2025-03-17 11:23:08,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:23:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 293 transitions. [2025-03-17 11:23:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 11:23:08,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:23:08,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:23:08,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:23:08,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:23:08,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:23:08,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1835609546, now seen corresponding path program 1 times [2025-03-17 11:23:08,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:23:08,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705775666] [2025-03-17 11:23:08,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:23:08,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 11:23:08,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 11:23:08,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:23:08,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:23:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:23:09,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:23:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705775666] [2025-03-17 11:23:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705775666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:23:09,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:23:09,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 11:23:09,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545345057] [2025-03-17 11:23:09,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:23:09,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 11:23:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:23:09,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 11:23:09,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 11:23:09,072 INFO L87 Difference]: Start difference. First operand 205 states and 293 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-17 11:23:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:23:09,206 INFO L93 Difference]: Finished difference Result 208 states and 289 transitions. [2025-03-17 11:23:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 11:23:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-03-17 11:23:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:23:09,208 INFO L225 Difference]: With dead ends: 208 [2025-03-17 11:23:09,208 INFO L226 Difference]: Without dead ends: 208 [2025-03-17 11:23:09,208 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-17 11:23:09,209 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 105 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:23:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 645 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:23:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-03-17 11:23:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2025-03-17 11:23:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 199 states have (on average 1.407035175879397) internal successors, (280), 200 states have internal predecessors, (280), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:23:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2025-03-17 11:23:09,216 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 79 [2025-03-17 11:23:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:23:09,216 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2025-03-17 11:23:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-17 11:23:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2025-03-17 11:23:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 11:23:09,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:23:09,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:23:09,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:23:09,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:23:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:23:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1205143203, now seen corresponding path program 1 times [2025-03-17 11:23:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:23:09,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440390918] [2025-03-17 11:23:09,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:23:09,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 11:23:09,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 11:23:09,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:23:09,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:23:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:23:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:23:09,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440390918] [2025-03-17 11:23:09,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440390918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:23:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:23:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:23:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238070863] [2025-03-17 11:23:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:23:09,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:23:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:23:09,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:23:09,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:23:09,404 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-17 11:23:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:23:09,483 INFO L93 Difference]: Finished difference Result 332 states and 472 transitions. [2025-03-17 11:23:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:23:09,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2025-03-17 11:23:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:23:09,485 INFO L225 Difference]: With dead ends: 332 [2025-03-17 11:23:09,485 INFO L226 Difference]: Without dead ends: 332 [2025-03-17 11:23:09,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:23:09,486 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 134 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:23:09,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 516 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:23:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-17 11:23:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-03-17 11:23:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 326 states have (on average 1.4294478527607362) internal successors, (466), 327 states have internal predecessors, (466), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:23:09,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 472 transitions. [2025-03-17 11:23:09,502 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 472 transitions. Word has length 79 [2025-03-17 11:23:09,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:23:09,502 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 472 transitions. [2025-03-17 11:23:09,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-17 11:23:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 472 transitions. [2025-03-17 11:23:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 11:23:09,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:23:09,506 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:23:09,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:23:09,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:23:09,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:23:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash 990345600, now seen corresponding path program 1 times [2025-03-17 11:23:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:23:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847381775] [2025-03-17 11:23:09,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:23:09,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:23:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:23:09,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:23:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:23:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:23:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:23:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847381775] [2025-03-17 11:23:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847381775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:23:09,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655377859] [2025-03-17 11:23:09,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:23:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:23:09,726 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-17 11:23:09,727 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-17 11:23:09,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:23:09,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:23:09,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:23:09,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:23:09,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:23:09,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:23:10,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:23:10,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:23:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:23:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655377859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:23:10,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:23:10,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-17 11:23:10,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949128634] [2025-03-17 11:23:10,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:23:10,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:23:10,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:23:10,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:23:10,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:23:10,255 INFO L87 Difference]: Start difference. First operand 332 states and 472 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:23:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:23:10,440 INFO L93 Difference]: Finished difference Result 776 states and 1096 transitions. [2025-03-17 11:23:10,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:23:10,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 94 [2025-03-17 11:23:10,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:23:10,444 INFO L225 Difference]: With dead ends: 776 [2025-03-17 11:23:10,446 INFO L226 Difference]: Without dead ends: 776 [2025-03-17 11:23:10,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:23:10,447 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1045 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:23:10,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 1271 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:23:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-17 11:23:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 776. [2025-03-17 11:23:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 761 states have (on average 1.4086727989487517) internal successors, (1072), 762 states have internal predecessors, (1072), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 11:23:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2025-03-17 11:23:10,475 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 94 [2025-03-17 11:23:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:23:10,475 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2025-03-17 11:23:10,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 11:23:10,475 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2025-03-17 11:23:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 11:23:10,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:23:10,486 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:23:10,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:23:10,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:23:10,687 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:23:10,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:23:10,688 INFO L85 PathProgramCache]: Analyzing trace with hash 202955061, now seen corresponding path program 1 times [2025-03-17 11:23:10,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:23:10,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388131757] [2025-03-17 11:23:10,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:10,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:23:10,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 11:23:10,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 11:23:10,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:23:10,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:23:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 4 proven. 156 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-17 11:23:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:23:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388131757] [2025-03-17 11:23:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388131757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:23:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891597582] [2025-03-17 11:23:11,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:11,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:23:11,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:23:11,301 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-17 11:23:11,302 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-17 11:23:11,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 11:23:11,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 11:23:11,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:23:11,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:23:11,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:23:11,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:23:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:23:12,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:23:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 436 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 11:23:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891597582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:23:12,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:23:12,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-17 11:23:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994884752] [2025-03-17 11:23:12,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:23:12,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 11:23:12,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:23:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 11:23:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-17 11:23:12,464 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand has 14 states, 14 states have (on average 52.92857142857143) internal successors, (741), 14 states have internal predecessors, (741), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 11:23:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:23:13,637 INFO L93 Difference]: Finished difference Result 1842 states and 2615 transitions. [2025-03-17 11:23:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:23:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 52.92857142857143) internal successors, (741), 14 states have internal predecessors, (741), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 313 [2025-03-17 11:23:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:23:13,645 INFO L225 Difference]: With dead ends: 1842 [2025-03-17 11:23:13,645 INFO L226 Difference]: Without dead ends: 1842 [2025-03-17 11:23:13,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=412, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:23:13,647 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 7561 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7561 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:23:13,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7561 Valid, 2579 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 11:23:13,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2025-03-17 11:23:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1842. [2025-03-17 11:23:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1827 states have (on average 1.4181718664477285) internal successors, (2591), 1828 states have internal predecessors, (2591), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 11:23:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2615 transitions. [2025-03-17 11:23:13,681 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2615 transitions. Word has length 313 [2025-03-17 11:23:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:23:13,681 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2615 transitions. [2025-03-17 11:23:13,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 52.92857142857143) internal successors, (741), 14 states have internal predecessors, (741), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 11:23:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2615 transitions. [2025-03-17 11:23:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2025-03-17 11:23:13,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:23:13,691 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-17 11:23:13,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 11:23:13,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:23:13,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 11:23:13,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:23:13,892 INFO L85 PathProgramCache]: Analyzing trace with hash -262303594, now seen corresponding path program 1 times [2025-03-17 11:23:13,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:23:13,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164074346] [2025-03-17 11:23:13,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:23:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:23:14,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 752 statements into 1 equivalence classes.