./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_SFH_test4-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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:12:37,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:12:37,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:12:37,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:12:37,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:12:37,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:12:37,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:12:37,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:12:37,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:12:37,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:12:37,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:12:37,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:12:37,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:12:37,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:12:37,962 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:12:37,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:12:37,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:12:37,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:12:37,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:12:37,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:12:37,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:12:37,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:12:37,965 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:12:37,965 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:12:37,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:12:37,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:12:37,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:12:37,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:12:37,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:12:37,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:12:37,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:12:37,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:12:37,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:12:37,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:12:37,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:12:37,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:12:37,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:12:37,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:12:37,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:12:37,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:12:37,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:12:37,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:12:37,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:12:37,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:12:37,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:12:37,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2024-11-17 00:12:38,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:12:38,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:12:38,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:12:38,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:12:38,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:12:38,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-11-17 00:12:39,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:12:39,713 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:12:39,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-11-17 00:12:39,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04f9a29f/e52006330d1b466d8e389226c0ddccfa/FLAG2c55ef0ad [2024-11-17 00:12:40,055 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f04f9a29f/e52006330d1b466d8e389226c0ddccfa [2024-11-17 00:12:40,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:12:40,058 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:12:40,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:12:40,059 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:12:40,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:12:40,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5060d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40, skipping insertion in model container [2024-11-17 00:12:40,064 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:12:40,441 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,473 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,480 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,484 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,495 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,527 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,529 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,532 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,535 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,548 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:12:40,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:12:40,574 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:12:40,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:12:40,691 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:12:40,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40 WrapperNode [2024-11-17 00:12:40,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:12:40,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:12:40,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:12:40,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:12:40,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,789 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1557 [2024-11-17 00:12:40,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:12:40,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:12:40,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:12:40,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:12:40,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,892 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-17 00:12:40,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,929 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:12:40,951 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:12:40,951 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:12:40,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:12:40,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (1/1) ... [2024-11-17 00:12:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:12:40,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:12:40,979 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) [2024-11-17 00:12:40,981 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 [2024-11-17 00:12:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 00:12:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 00:12:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:12:41,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:12:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 00:12:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 00:12:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:12:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:12:41,049 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:12:41,054 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:12:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:12:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:12:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:12:41,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:12:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:12:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:12:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:12:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:12:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:12:41,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:12:41,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:12:41,274 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:12:41,276 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:12:42,585 INFO L? ?]: Removed 389 outVars from TransFormulas that were not future-live. [2024-11-17 00:12:42,585 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:12:42,632 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:12:42,636 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-17 00:12:42,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:12:42 BoogieIcfgContainer [2024-11-17 00:12:42,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:12:42,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:12:42,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:12:42,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:12:42,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:12:40" (1/3) ... [2024-11-17 00:12:42,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac1e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:12:42, skipping insertion in model container [2024-11-17 00:12:42,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:12:40" (2/3) ... [2024-11-17 00:12:42,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac1e0ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:12:42, skipping insertion in model container [2024-11-17 00:12:42,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:12:42" (3/3) ... [2024-11-17 00:12:42,643 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2024-11-17 00:12:42,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:12:42,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:12:42,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:12:42,711 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;@5a1b656f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:12:42,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:12:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 435 states, 414 states have (on average 1.608695652173913) internal successors, (666), 426 states have internal predecessors, (666), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-17 00:12:42,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:42,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:42,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:42,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:42,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1532047443, now seen corresponding path program 1 times [2024-11-17 00:12:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948548841] [2024-11-17 00:12:42,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:42,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:12:42,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:42,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948548841] [2024-11-17 00:12:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948548841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:42,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:42,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:12:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884654004] [2024-11-17 00:12:42,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:42,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:12:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:12:42,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:12:42,907 INFO L87 Difference]: Start difference. First operand has 435 states, 414 states have (on average 1.608695652173913) internal successors, (666), 426 states have internal predecessors, (666), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-11-17 00:12:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:43,024 INFO L93 Difference]: Finished difference Result 434 states and 628 transitions. [2024-11-17 00:12:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:12:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-17 00:12:43,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:43,041 INFO L225 Difference]: With dead ends: 434 [2024-11-17 00:12:43,041 INFO L226 Difference]: Without dead ends: 431 [2024-11-17 00:12:43,043 INFO L431 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 [2024-11-17 00:12:43,045 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:43,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:12:43,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-17 00:12:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2024-11-17 00:12:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 411 states have (on average 1.4428223844282237) internal successors, (593), 422 states have internal predecessors, (593), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 625 transitions. [2024-11-17 00:12:43,108 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 625 transitions. Word has length 8 [2024-11-17 00:12:43,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:43,110 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 625 transitions. [2024-11-17 00:12:43,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-11-17 00:12:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 625 transitions. [2024-11-17 00:12:43,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:12:43,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:43,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:43,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:12:43,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:43,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:43,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2096357988, now seen corresponding path program 1 times [2024-11-17 00:12:43,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:43,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111763346] [2024-11-17 00:12:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:12:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:43,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111763346] [2024-11-17 00:12:43,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111763346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:43,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:43,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:12:43,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632362714] [2024-11-17 00:12:43,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:43,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:12:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:43,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:12:43,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:12:43,219 INFO L87 Difference]: Start difference. First operand 431 states and 625 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-17 00:12:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:43,365 INFO L93 Difference]: Finished difference Result 820 states and 1188 transitions. [2024-11-17 00:12:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:12:43,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-17 00:12:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:43,370 INFO L225 Difference]: With dead ends: 820 [2024-11-17 00:12:43,370 INFO L226 Difference]: Without dead ends: 820 [2024-11-17 00:12:43,371 INFO L431 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 [2024-11-17 00:12:43,372 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 549 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:43,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1245 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:12:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-11-17 00:12:43,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 433. [2024-11-17 00:12:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 413 states have (on average 1.4406779661016949) internal successors, (595), 424 states have internal predecessors, (595), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 627 transitions. [2024-11-17 00:12:43,394 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 627 transitions. Word has length 10 [2024-11-17 00:12:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:43,394 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 627 transitions. [2024-11-17 00:12:43,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-17 00:12:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 627 transitions. [2024-11-17 00:12:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 00:12:43,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:43,399 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:43,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:12:43,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:43,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1962056606, now seen corresponding path program 1 times [2024-11-17 00:12:43,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:43,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261532802] [2024-11-17 00:12:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:12:43,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261532802] [2024-11-17 00:12:43,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261532802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:43,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:43,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:12:43,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805947722] [2024-11-17 00:12:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:43,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:12:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:43,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:12:43,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:12:43,918 INFO L87 Difference]: Start difference. First operand 433 states and 627 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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) [2024-11-17 00:12:44,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:44,082 INFO L93 Difference]: Finished difference Result 436 states and 623 transitions. [2024-11-17 00:12:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:12:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 159 [2024-11-17 00:12:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:44,084 INFO L225 Difference]: With dead ends: 436 [2024-11-17 00:12:44,085 INFO L226 Difference]: Without dead ends: 436 [2024-11-17 00:12:44,087 INFO L431 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 [2024-11-17 00:12:44,088 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 105 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:44,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1574 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:12:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-17 00:12:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 433. [2024-11-17 00:12:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 413 states have (on average 1.423728813559322) internal successors, (588), 424 states have internal predecessors, (588), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 620 transitions. [2024-11-17 00:12:44,103 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 620 transitions. Word has length 159 [2024-11-17 00:12:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:44,103 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 620 transitions. [2024-11-17 00:12:44,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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) [2024-11-17 00:12:44,104 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 620 transitions. [2024-11-17 00:12:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-17 00:12:44,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:44,113 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:44,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:12:44,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:44,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash -443205339, now seen corresponding path program 1 times [2024-11-17 00:12:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594519170] [2024-11-17 00:12:44,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:44,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:12:44,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:44,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594519170] [2024-11-17 00:12:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594519170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:44,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:44,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:12:44,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13828093] [2024-11-17 00:12:44,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:44,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:12:44,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:12:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:12:44,374 INFO L87 Difference]: Start difference. First operand 433 states and 620 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-17 00:12:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:44,486 INFO L93 Difference]: Finished difference Result 563 states and 809 transitions. [2024-11-17 00:12:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:12:44,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 159 [2024-11-17 00:12:44,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:44,489 INFO L225 Difference]: With dead ends: 563 [2024-11-17 00:12:44,489 INFO L226 Difference]: Without dead ends: 563 [2024-11-17 00:12:44,489 INFO L431 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 [2024-11-17 00:12:44,490 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 134 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:44,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1139 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:12:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-17 00:12:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2024-11-17 00:12:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 543 states have (on average 1.430939226519337) internal successors, (777), 554 states have internal predecessors, (777), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 809 transitions. [2024-11-17 00:12:44,510 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 809 transitions. Word has length 159 [2024-11-17 00:12:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:44,510 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 809 transitions. [2024-11-17 00:12:44,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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) [2024-11-17 00:12:44,511 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 809 transitions. [2024-11-17 00:12:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-17 00:12:44,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:44,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:44,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:12:44,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash 192982993, now seen corresponding path program 1 times [2024-11-17 00:12:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:44,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372267053] [2024-11-17 00:12:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:44,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372267053] [2024-11-17 00:12:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372267053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:44,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:44,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:12:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031678595] [2024-11-17 00:12:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:44,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:12:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:44,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:12:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:12:44,811 INFO L87 Difference]: Start difference. First operand 563 states and 809 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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) [2024-11-17 00:12:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:45,190 INFO L93 Difference]: Finished difference Result 578 states and 830 transitions. [2024-11-17 00:12:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:12:45,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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 174 [2024-11-17 00:12:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:45,194 INFO L225 Difference]: With dead ends: 578 [2024-11-17 00:12:45,194 INFO L226 Difference]: Without dead ends: 578 [2024-11-17 00:12:45,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:12:45,195 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 9 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:45,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1535 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:12:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-11-17 00:12:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2024-11-17 00:12:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 555 states have (on average 1.4216216216216215) internal successors, (789), 566 states have internal predecessors, (789), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 821 transitions. [2024-11-17 00:12:45,212 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 821 transitions. Word has length 174 [2024-11-17 00:12:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:45,214 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 821 transitions. [2024-11-17 00:12:45,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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) [2024-11-17 00:12:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 821 transitions. [2024-11-17 00:12:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-17 00:12:45,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:45,218 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:45,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:12:45,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:45,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:45,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1684285902, now seen corresponding path program 1 times [2024-11-17 00:12:45,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:45,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500236760] [2024-11-17 00:12:45,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:45,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:45,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:45,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500236760] [2024-11-17 00:12:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500236760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:12:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60154163] [2024-11-17 00:12:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:12:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:45,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:12:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:12:45,536 INFO L87 Difference]: Start difference. First operand 575 states and 821 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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) [2024-11-17 00:12:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:45,911 INFO L93 Difference]: Finished difference Result 536 states and 753 transitions. [2024-11-17 00:12:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:12:45,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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 174 [2024-11-17 00:12:45,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:45,914 INFO L225 Difference]: With dead ends: 536 [2024-11-17 00:12:45,915 INFO L226 Difference]: Without dead ends: 536 [2024-11-17 00:12:45,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:12:45,916 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 39 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:45,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1745 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:12:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-17 00:12:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2024-11-17 00:12:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 513 states have (on average 1.387914230019493) internal successors, (712), 524 states have internal predecessors, (712), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 744 transitions. [2024-11-17 00:12:45,930 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 744 transitions. Word has length 174 [2024-11-17 00:12:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:45,931 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 744 transitions. [2024-11-17 00:12:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 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) [2024-11-17 00:12:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 744 transitions. [2024-11-17 00:12:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-17 00:12:45,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:45,934 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:45,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:12:45,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:45,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2015124807, now seen corresponding path program 1 times [2024-11-17 00:12:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:45,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126505858] [2024-11-17 00:12:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:46,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:46,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:46,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:46,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126505858] [2024-11-17 00:12:46,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126505858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:46,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:46,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:12:46,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685700905] [2024-11-17 00:12:46,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:46,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:12:46,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:46,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:12:46,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:12:46,192 INFO L87 Difference]: Start difference. First operand 533 states and 744 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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) [2024-11-17 00:12:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:46,503 INFO L93 Difference]: Finished difference Result 536 states and 750 transitions. [2024-11-17 00:12:46,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:12:46,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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 174 [2024-11-17 00:12:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:46,506 INFO L225 Difference]: With dead ends: 536 [2024-11-17 00:12:46,506 INFO L226 Difference]: Without dead ends: 536 [2024-11-17 00:12:46,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:12:46,508 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 10 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:46,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1321 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:12:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-17 00:12:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2024-11-17 00:12:46,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 513 states have (on average 1.3820662768031189) internal successors, (709), 524 states have internal predecessors, (709), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-17 00:12:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 741 transitions. [2024-11-17 00:12:46,519 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 741 transitions. Word has length 174 [2024-11-17 00:12:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:46,520 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 741 transitions. [2024-11-17 00:12:46,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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) [2024-11-17 00:12:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 741 transitions. [2024-11-17 00:12:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-17 00:12:46,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:46,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:46,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:12:46,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:46,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1586449784, now seen corresponding path program 1 times [2024-11-17 00:12:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:46,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123069688] [2024-11-17 00:12:46,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:46,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:12:46,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:46,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123069688] [2024-11-17 00:12:46,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123069688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:12:46,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:12:46,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:12:46,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82599598] [2024-11-17 00:12:46,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:12:46,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:12:46,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:46,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:12:46,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:12:46,795 INFO L87 Difference]: Start difference. First operand 533 states and 741 transitions. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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) [2024-11-17 00:12:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:47,158 INFO L93 Difference]: Finished difference Result 684 states and 949 transitions. [2024-11-17 00:12:47,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:12:47,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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 174 [2024-11-17 00:12:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:47,164 INFO L225 Difference]: With dead ends: 684 [2024-11-17 00:12:47,164 INFO L226 Difference]: Without dead ends: 684 [2024-11-17 00:12:47,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:12:47,165 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 253 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:47,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1348 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:12:47,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2024-11-17 00:12:47,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 681. [2024-11-17 00:12:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 658 states have (on average 1.3662613981762919) internal successors, (899), 669 states have internal predecessors, (899), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-17 00:12:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 937 transitions. [2024-11-17 00:12:47,184 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 937 transitions. Word has length 174 [2024-11-17 00:12:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:47,184 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 937 transitions. [2024-11-17 00:12:47,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 3 states have internal predecessors, (167), 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) [2024-11-17 00:12:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 937 transitions. [2024-11-17 00:12:47,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-17 00:12:47,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:47,186 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:47,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:12:47,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:47,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash 837527200, now seen corresponding path program 1 times [2024-11-17 00:12:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:47,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38397170] [2024-11-17 00:12:47,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:47,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:47,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-17 00:12:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-17 00:12:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:12:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38397170] [2024-11-17 00:12:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38397170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:12:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810522640] [2024-11-17 00:12:47,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:47,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:12:47,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:12:47,461 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) [2024-11-17 00:12:47,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-17 00:12:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:47,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:12:47,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:12:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:12:48,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:12:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:12:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810522640] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:12:48,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:12:48,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-17 00:12:48,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205207584] [2024-11-17 00:12:48,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:12:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:12:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:48,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:12:48,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:12:48,248 INFO L87 Difference]: Start difference. First operand 681 states and 937 transitions. Second operand has 8 states, 8 states have (on average 61.875) internal successors, (495), 7 states have internal predecessors, (495), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-17 00:12:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:48,849 INFO L93 Difference]: Finished difference Result 1455 states and 2013 transitions. [2024-11-17 00:12:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:12:48,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 61.875) internal successors, (495), 7 states have internal predecessors, (495), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 189 [2024-11-17 00:12:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:48,856 INFO L225 Difference]: With dead ends: 1455 [2024-11-17 00:12:48,856 INFO L226 Difference]: Without dead ends: 1455 [2024-11-17 00:12:48,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:12:48,858 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 1784 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:48,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 3018 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 00:12:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-11-17 00:12:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1452. [2024-11-17 00:12:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1414 states have (on average 1.3564356435643565) internal successors, (1918), 1425 states have internal predecessors, (1918), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 25 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-17 00:12:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1986 transitions. [2024-11-17 00:12:48,909 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1986 transitions. Word has length 189 [2024-11-17 00:12:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:48,910 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 1986 transitions. [2024-11-17 00:12:48,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 61.875) internal successors, (495), 7 states have internal predecessors, (495), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-17 00:12:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1986 transitions. [2024-11-17 00:12:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2024-11-17 00:12:48,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:48,919 INFO L215 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:48,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:12:49,120 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 [2024-11-17 00:12:49,121 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash 363605478, now seen corresponding path program 1 times [2024-11-17 00:12:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:49,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874120834] [2024-11-17 00:12:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:49,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:12:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:49,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-17 00:12:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-17 00:12:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-17 00:12:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-17 00:12:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 8 proven. 375 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2024-11-17 00:12:49,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:12:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874120834] [2024-11-17 00:12:49,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874120834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:12:49,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588735852] [2024-11-17 00:12:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:49,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:12:49,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:12:49,957 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) [2024-11-17 00:12:49,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-17 00:12:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:12:50,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 3107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:12:50,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:12:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 890 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:12:51,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:12:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 0 proven. 890 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-17 00:12:52,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588735852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:12:52,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:12:52,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-11-17 00:12:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360698009] [2024-11-17 00:12:52,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:12:52,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 00:12:52,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:12:52,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 00:12:52,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-17 00:12:52,145 INFO L87 Difference]: Start difference. First operand 1452 states and 1986 transitions. Second operand has 15 states, 15 states have (on average 101.6) internal successors, (1524), 14 states have internal predecessors, (1524), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-17 00:12:54,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:12:54,885 INFO L93 Difference]: Finished difference Result 3516 states and 4859 transitions. [2024-11-17 00:12:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-17 00:12:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 101.6) internal successors, (1524), 14 states have internal predecessors, (1524), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 636 [2024-11-17 00:12:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:12:54,896 INFO L225 Difference]: With dead ends: 3516 [2024-11-17 00:12:54,896 INFO L226 Difference]: Without dead ends: 3516 [2024-11-17 00:12:54,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1280 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2024-11-17 00:12:54,898 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 12419 mSDsluCounter, 4625 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12429 SdHoareTripleChecker+Valid, 5415 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:12:54,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12429 Valid, 5415 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 00:12:54,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2024-11-17 00:12:54,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3491. [2024-11-17 00:12:54,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3491 states, 3435 states have (on average 1.3589519650655022) internal successors, (4668), 3446 states have internal predecessors, (4668), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 43 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-17 00:12:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3491 states to 3491 states and 4772 transitions. [2024-11-17 00:12:54,943 INFO L78 Accepts]: Start accepts. Automaton has 3491 states and 4772 transitions. Word has length 636 [2024-11-17 00:12:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:12:54,943 INFO L471 AbstractCegarLoop]: Abstraction has 3491 states and 4772 transitions. [2024-11-17 00:12:54,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 101.6) internal successors, (1524), 14 states have internal predecessors, (1524), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-17 00:12:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3491 states and 4772 transitions. [2024-11-17 00:12:54,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1534 [2024-11-17 00:12:54,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:12:54,986 INFO L215 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:12:55,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:12:55,186 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 [2024-11-17 00:12:55,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:12:55,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:12:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1908302890, now seen corresponding path program 1 times [2024-11-17 00:12:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:12:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344901319] [2024-11-17 00:12:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:12:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms