./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d 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_test9-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 f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:30:31,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:30:31,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:30:31,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:30:31,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:30:31,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:30:31,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:30:31,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:30:31,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:30:31,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:30:31,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:30:31,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:30:31,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:30:31,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:30:31,904 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:30:31,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:30:31,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:30:31,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:30:31,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:30:31,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:30:31,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:30:31,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:30:31,909 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:30:31,910 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:30:31,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:30:31,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:30:31,910 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:30:31,910 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:30:31,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:30:31,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:30:31,911 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:30:31,911 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:30:31,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:30:31,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:30:31,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:30:31,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:30:31,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:30:31,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:30:31,912 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:30:31,912 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:30:31,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:30:31,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:30:31,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:30:31,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:30:31,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:30:31,914 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 -> f4a8b24485e53fece96b44fdc12e6f161e1bbffda2cd597a930f4925e148dc01 [2024-11-09 07:30:32,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:30:32,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:30:32,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:30:32,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:30:32,162 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:30:32,164 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_test9-1.i [2024-11-09 07:30:33,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:30:33,677 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:30:33,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-1.i [2024-11-09 07:30:33,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1720241b7/9748bb10db4345959d3526edc41fb303/FLAG343a413ce [2024-11-09 07:30:33,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1720241b7/9748bb10db4345959d3526edc41fb303 [2024-11-09 07:30:33,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:30:33,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:30:33,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:30:33,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:30:33,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:30:33,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:33" (1/1) ... [2024-11-09 07:30:33,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799e2421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:33, skipping insertion in model container [2024-11-09 07:30:33,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:30:33" (1/1) ... [2024-11-09 07:30:34,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:30:34,512 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,553 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,557 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,559 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,567 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,591 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,592 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,593 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,593 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:30:34,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:30:34,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:30:34,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:30:34,753 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:30:34,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34 WrapperNode [2024-11-09 07:30:34,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:30:34,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:30:34,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:30:34,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:30:34,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:34,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:34,873 INFO L138 Inliner]: procedures = 177, calls = 724, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3282 [2024-11-09 07:30:34,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:30:34,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:30:34,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:30:34,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:30:34,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:34,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:34,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:34,959 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-09 07:30:34,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:34,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:35,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:35,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:35,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:35,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:35,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:30:35,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:30:35,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:30:35,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:30:35,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (1/1) ... [2024-11-09 07:30:35,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:30:35,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:30:35,106 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-09 07:30:35,109 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-09 07:30:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:30:35,146 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:30:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:30:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:30:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:30:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:30:35,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:30:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:30:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:30:35,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:30:35,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 07:30:35,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 07:30:35,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 07:30:35,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 07:30:35,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 07:30:35,149 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 07:30:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:30:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:30:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:30:35,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:30:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:30:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:30:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:30:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:30:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:30:35,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:30:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:30:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:30:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:30:35,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:30:35,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:30:35,329 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:30:35,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:30:37,302 INFO L? ?]: Removed 799 outVars from TransFormulas that were not future-live. [2024-11-09 07:30:37,302 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:30:37,332 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:30:37,335 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 07:30:37,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:30:37 BoogieIcfgContainer [2024-11-09 07:30:37,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:30:37,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:30:37,337 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:30:37,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:30:37,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:30:33" (1/3) ... [2024-11-09 07:30:37,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559c0fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:37, skipping insertion in model container [2024-11-09 07:30:37,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:30:34" (2/3) ... [2024-11-09 07:30:37,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559c0fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:30:37, skipping insertion in model container [2024-11-09 07:30:37,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:30:37" (3/3) ... [2024-11-09 07:30:37,344 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-1.i [2024-11-09 07:30:37,356 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:30:37,357 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:30:37,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:30:37,432 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;@57c78cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:30:37,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:30:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 1375 states, 864 states have (on average 1.8391203703703705) internal successors, (1589), 1368 states have internal predecessors, (1589), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-09 07:30:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:30:37,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:37,445 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:30:37,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:37,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1582134003, now seen corresponding path program 1 times [2024-11-09 07:30:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:37,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199540039] [2024-11-09 07:30:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:37,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:37,614 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-09 07:30:37,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199540039] [2024-11-09 07:30:37,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199540039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:37,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:37,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:30:37,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440667699] [2024-11-09 07:30:37,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:37,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:30:37,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:37,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:30:37,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:30:37,655 INFO L87 Difference]: Start difference. First operand has 1375 states, 864 states have (on average 1.8391203703703705) internal successors, (1589), 1368 states have internal predecessors, (1589), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:37,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:37,750 INFO L93 Difference]: Finished difference Result 1373 states and 2536 transitions. [2024-11-09 07:30:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:30:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:30:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:37,779 INFO L225 Difference]: With dead ends: 1373 [2024-11-09 07:30:37,779 INFO L226 Difference]: Without dead ends: 1371 [2024-11-09 07:30:37,781 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-09 07:30:37,784 INFO L432 NwaCegarLoop]: 2536 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:37,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2536 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:30:37,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2024-11-09 07:30:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2024-11-09 07:30:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 862 states have (on average 1.7703016241299303) internal successors, (1526), 1364 states have internal predecessors, (1526), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:30:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 2534 transitions. [2024-11-09 07:30:38,050 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 2534 transitions. Word has length 7 [2024-11-09 07:30:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:38,050 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 2534 transitions. [2024-11-09 07:30:38,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2534 transitions. [2024-11-09 07:30:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:30:38,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:38,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:30:38,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:30:38,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:38,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash -940141398, now seen corresponding path program 1 times [2024-11-09 07:30:38,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:38,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473064375] [2024-11-09 07:30:38,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:38,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:38,229 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-09 07:30:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:38,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473064375] [2024-11-09 07:30:38,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473064375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:38,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:38,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:30:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030387908] [2024-11-09 07:30:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:38,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:30:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:30:38,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:30:38,260 INFO L87 Difference]: Start difference. First operand 1371 states and 2534 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:38,924 INFO L93 Difference]: Finished difference Result 2725 states and 5052 transitions. [2024-11-09 07:30:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:30:38,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 07:30:38,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:38,937 INFO L225 Difference]: With dead ends: 2725 [2024-11-09 07:30:38,937 INFO L226 Difference]: Without dead ends: 2725 [2024-11-09 07:30:38,937 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-09 07:30:38,938 INFO L432 NwaCegarLoop]: 2623 mSDtfsCounter, 1508 mSDsluCounter, 4630 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 7253 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:38,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 7253 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:30:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2024-11-09 07:30:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 1373. [2024-11-09 07:30:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 864 states have (on average 1.7685185185185186) internal successors, (1528), 1366 states have internal predecessors, (1528), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:30:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 2536 transitions. [2024-11-09 07:30:39,142 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 2536 transitions. Word has length 9 [2024-11-09 07:30:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:39,142 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 2536 transitions. [2024-11-09 07:30:39,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:30:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 2536 transitions. [2024-11-09 07:30:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:30:39,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:39,145 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] [2024-11-09 07:30:39,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:30:39,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:39,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1595289559, now seen corresponding path program 1 times [2024-11-09 07:30:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224480495] [2024-11-09 07:30:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:39,423 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-09 07:30:39,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:39,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224480495] [2024-11-09 07:30:39,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224480495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:39,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:39,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:30:39,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336735997] [2024-11-09 07:30:39,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:39,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:30:39,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:39,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:30:39,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:30:39,427 INFO L87 Difference]: Start difference. First operand 1373 states and 2536 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-09 07:30:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:39,499 INFO L93 Difference]: Finished difference Result 1331 states and 2459 transitions. [2024-11-09 07:30:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:30:39,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-11-09 07:30:39,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:39,504 INFO L225 Difference]: With dead ends: 1331 [2024-11-09 07:30:39,505 INFO L226 Difference]: Without dead ends: 1331 [2024-11-09 07:30:39,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:30:39,506 INFO L432 NwaCegarLoop]: 2429 mSDtfsCounter, 36 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 7273 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:39,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 7273 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:30:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-09 07:30:39,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1331. [2024-11-09 07:30:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 822 states have (on average 1.7652068126520681) internal successors, (1451), 1324 states have internal predecessors, (1451), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:30:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2459 transitions. [2024-11-09 07:30:39,603 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2459 transitions. Word has length 85 [2024-11-09 07:30:39,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:39,604 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 2459 transitions. [2024-11-09 07:30:39,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-09 07:30:39,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2459 transitions. [2024-11-09 07:30:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:30:39,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:39,610 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] [2024-11-09 07:30:39,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:30:39,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -820400491, now seen corresponding path program 1 times [2024-11-09 07:30:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369681260] [2024-11-09 07:30:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:39,799 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-09 07:30:39,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:39,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369681260] [2024-11-09 07:30:39,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369681260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:39,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:39,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:30:39,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740161878] [2024-11-09 07:30:39,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:39,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:30:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:30:39,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:30:39,801 INFO L87 Difference]: Start difference. First operand 1331 states and 2459 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-09 07:30:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:39,879 INFO L93 Difference]: Finished difference Result 1325 states and 2449 transitions. [2024-11-09 07:30:39,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:30:39,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 85 [2024-11-09 07:30:39,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:39,886 INFO L225 Difference]: With dead ends: 1325 [2024-11-09 07:30:39,887 INFO L226 Difference]: Without dead ends: 1325 [2024-11-09 07:30:39,887 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-09 07:30:39,888 INFO L432 NwaCegarLoop]: 2431 mSDtfsCounter, 9 mSDsluCounter, 4843 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:39,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 7274 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:30:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-11-09 07:30:39,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1325. [2024-11-09 07:30:39,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 816 states have (on average 1.7659313725490196) internal successors, (1441), 1318 states have internal predecessors, (1441), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:30:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2449 transitions. [2024-11-09 07:30:39,996 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2449 transitions. Word has length 85 [2024-11-09 07:30:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:39,996 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 2449 transitions. [2024-11-09 07:30:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-09 07:30:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2449 transitions. [2024-11-09 07:30:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:30:39,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:39,998 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] [2024-11-09 07:30:39,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:30:39,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1922320029, now seen corresponding path program 1 times [2024-11-09 07:30:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018265431] [2024-11-09 07:30:39,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:40,096 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-09 07:30:40,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018265431] [2024-11-09 07:30:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018265431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:40,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:40,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:30:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550386143] [2024-11-09 07:30:40,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:40,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:30:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:40,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:30:40,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:30:40,100 INFO L87 Difference]: Start difference. First operand 1325 states and 2449 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-09 07:30:40,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:40,178 INFO L93 Difference]: Finished difference Result 2546 states and 4764 transitions. [2024-11-09 07:30:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:30:40,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2024-11-09 07:30:40,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:40,190 INFO L225 Difference]: With dead ends: 2546 [2024-11-09 07:30:40,190 INFO L226 Difference]: Without dead ends: 2546 [2024-11-09 07:30:40,191 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-09 07:30:40,193 INFO L432 NwaCegarLoop]: 2654 mSDtfsCounter, 1259 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 5087 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:40,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1759 Valid, 5087 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:30:40,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-11-09 07:30:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2542. [2024-11-09 07:30:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1533 states have (on average 1.7958251793868232) internal successors, (2753), 2535 states have internal predecessors, (2753), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:30:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4761 transitions. [2024-11-09 07:30:40,369 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4761 transitions. Word has length 85 [2024-11-09 07:30:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:40,369 INFO L471 AbstractCegarLoop]: Abstraction has 2542 states and 4761 transitions. [2024-11-09 07:30:40,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-09 07:30:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4761 transitions. [2024-11-09 07:30:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 07:30:40,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:40,370 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] [2024-11-09 07:30:40,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:30:40,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 559394108, now seen corresponding path program 1 times [2024-11-09 07:30:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:40,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187016262] [2024-11-09 07:30:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:40,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:30:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:40,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:30:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:40,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:30:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187016262] [2024-11-09 07:30:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187016262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:40,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:30:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041848164] [2024-11-09 07:30:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:40,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:30:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:40,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:30:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:30:40,621 INFO L87 Difference]: Start difference. First operand 2542 states and 4761 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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-09 07:30:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:44,000 INFO L93 Difference]: Finished difference Result 4772 states and 9094 transitions. [2024-11-09 07:30:44,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:30:44,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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 100 [2024-11-09 07:30:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:44,018 INFO L225 Difference]: With dead ends: 4772 [2024-11-09 07:30:44,018 INFO L226 Difference]: Without dead ends: 4772 [2024-11-09 07:30:44,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-09 07:30:44,019 INFO L432 NwaCegarLoop]: 2647 mSDtfsCounter, 1427 mSDsluCounter, 4698 mSDsCounter, 0 mSdLazyCounter, 2610 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 7345 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 2610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:44,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 7345 Invalid, 3615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 2610 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 07:30:44,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2024-11-09 07:30:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 2544. [2024-11-09 07:30:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1535 states have (on average 1.794788273615635) internal successors, (2755), 2537 states have internal predecessors, (2755), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:30:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 4763 transitions. [2024-11-09 07:30:44,338 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 4763 transitions. Word has length 100 [2024-11-09 07:30:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:44,338 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 4763 transitions. [2024-11-09 07:30:44,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 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-09 07:30:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 4763 transitions. [2024-11-09 07:30:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 07:30:44,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:44,340 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] [2024-11-09 07:30:44,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:30:44,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:44,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash 114127026, now seen corresponding path program 1 times [2024-11-09 07:30:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:44,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619823722] [2024-11-09 07:30:44,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:44,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:30:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:44,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:30:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:30:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619823722] [2024-11-09 07:30:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619823722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:44,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:30:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451068348] [2024-11-09 07:30:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:30:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:44,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:30:44,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:30:44,620 INFO L87 Difference]: Start difference. First operand 2544 states and 4763 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:30:46,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:46,272 INFO L93 Difference]: Finished difference Result 2463 states and 4615 transitions. [2024-11-09 07:30:46,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:30:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-09 07:30:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:46,282 INFO L225 Difference]: With dead ends: 2463 [2024-11-09 07:30:46,282 INFO L226 Difference]: Without dead ends: 2463 [2024-11-09 07:30:46,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:30:46,284 INFO L432 NwaCegarLoop]: 2334 mSDtfsCounter, 51 mSDsluCounter, 4933 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 7267 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 536 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:46,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 7267 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [536 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 07:30:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2024-11-09 07:30:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2460. [2024-11-09 07:30:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2460 states, 1451 states have (on average 1.7925568573397657) internal successors, (2601), 2453 states have internal predecessors, (2601), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:30:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 4609 transitions. [2024-11-09 07:30:46,482 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 4609 transitions. Word has length 157 [2024-11-09 07:30:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:46,483 INFO L471 AbstractCegarLoop]: Abstraction has 2460 states and 4609 transitions. [2024-11-09 07:30:46,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:30:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 4609 transitions. [2024-11-09 07:30:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 07:30:46,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:46,485 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] [2024-11-09 07:30:46,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:30:46,485 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash -430129184, now seen corresponding path program 1 times [2024-11-09 07:30:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877504351] [2024-11-09 07:30:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:46,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:30:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:46,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:30:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:30:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877504351] [2024-11-09 07:30:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877504351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:30:46,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330794278] [2024-11-09 07:30:46,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:46,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:30:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:46,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:30:46,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:30:46,740 INFO L87 Difference]: Start difference. First operand 2460 states and 4609 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:30:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:48,392 INFO L93 Difference]: Finished difference Result 2451 states and 4595 transitions. [2024-11-09 07:30:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:30:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-09 07:30:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:48,403 INFO L225 Difference]: With dead ends: 2451 [2024-11-09 07:30:48,403 INFO L226 Difference]: Without dead ends: 2451 [2024-11-09 07:30:48,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-09 07:30:48,404 INFO L432 NwaCegarLoop]: 2336 mSDtfsCounter, 19 mSDsluCounter, 4934 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7270 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:48,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7270 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 07:30:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2451 states. [2024-11-09 07:30:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2451 to 2448. [2024-11-09 07:30:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 1439 states have (on average 1.7936066712995136) internal successors, (2581), 2441 states have internal predecessors, (2581), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-09 07:30:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 4589 transitions. [2024-11-09 07:30:48,598 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 4589 transitions. Word has length 157 [2024-11-09 07:30:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:48,598 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 4589 transitions. [2024-11-09 07:30:48,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 4 states have internal predecessors, (148), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:30:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 4589 transitions. [2024-11-09 07:30:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 07:30:48,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:48,600 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] [2024-11-09 07:30:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:30:48,600 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 314420200, now seen corresponding path program 1 times [2024-11-09 07:30:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:48,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356252612] [2024-11-09 07:30:48,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:30:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:30:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:48,846 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-09 07:30:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356252612] [2024-11-09 07:30:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356252612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:30:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:30:48,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:30:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290692477] [2024-11-09 07:30:48,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:30:48,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:30:48,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:48,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:30:48,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:30:48,849 INFO L87 Difference]: Start difference. First operand 2448 states and 4589 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:30:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:51,623 INFO L93 Difference]: Finished difference Result 2534 states and 4703 transitions. [2024-11-09 07:30:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:30:51,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-11-09 07:30:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:51,631 INFO L225 Difference]: With dead ends: 2534 [2024-11-09 07:30:51,632 INFO L226 Difference]: Without dead ends: 2534 [2024-11-09 07:30:51,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:30:51,632 INFO L432 NwaCegarLoop]: 2496 mSDtfsCounter, 3766 mSDsluCounter, 4432 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 2009 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4268 SdHoareTripleChecker+Valid, 6928 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2009 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:51,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4268 Valid, 6928 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2009 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 07:30:51,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-11-09 07:30:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 1360. [2024-11-09 07:30:51,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 851 states have (on average 1.7179788484136311) internal successors, (1462), 1353 states have internal predecessors, (1462), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-09 07:30:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2470 transitions. [2024-11-09 07:30:51,799 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2470 transitions. Word has length 157 [2024-11-09 07:30:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:51,799 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 2470 transitions. [2024-11-09 07:30:51,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:30:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2470 transitions. [2024-11-09 07:30:51,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-09 07:30:51,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:51,817 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] [2024-11-09 07:30:51,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:30:51,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:51,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash -565706756, now seen corresponding path program 1 times [2024-11-09 07:30:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:51,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192723098] [2024-11-09 07:30:51,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:30:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:52,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:30:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:30:52,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:30:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192723098] [2024-11-09 07:30:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192723098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:30:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884839816] [2024-11-09 07:30:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:52,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:30:52,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:30:52,384 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-09 07:30:52,384 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-09 07:30:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:30:52,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:30:52,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:30:52,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:30:52,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:30:52,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:30:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:30:52,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:30:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:30:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884839816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:30:53,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:30:53,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 12 [2024-11-09 07:30:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347903403] [2024-11-09 07:30:53,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:30:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:30:53,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:30:53,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:30:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:30:53,123 INFO L87 Difference]: Start difference. First operand 1360 states and 2470 transitions. Second operand has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 11 states have internal predecessors, (250), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:30:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:30:59,157 INFO L93 Difference]: Finished difference Result 4064 states and 7406 transitions. [2024-11-09 07:30:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:30:59,158 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 11 states have internal predecessors, (250), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 167 [2024-11-09 07:30:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:30:59,168 INFO L225 Difference]: With dead ends: 4064 [2024-11-09 07:30:59,168 INFO L226 Difference]: Without dead ends: 4064 [2024-11-09 07:30:59,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 331 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:30:59,169 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 5532 mSDsluCounter, 11153 mSDsCounter, 0 mSdLazyCounter, 6317 mSolverCounterSat, 3021 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6544 SdHoareTripleChecker+Valid, 13032 SdHoareTripleChecker+Invalid, 9338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3021 IncrementalHoareTripleChecker+Valid, 6317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:30:59,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6544 Valid, 13032 Invalid, 9338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3021 Valid, 6317 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-09 07:30:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2024-11-09 07:30:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 1695. [2024-11-09 07:30:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1182 states have (on average 1.6065989847715736) internal successors, (1899), 1684 states have internal predecessors, (1899), 508 states have call successors, (508), 4 states have call predecessors, (508), 3 states have return successors, (506), 7 states have call predecessors, (506), 506 states have call successors, (506) [2024-11-09 07:30:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2913 transitions. [2024-11-09 07:30:59,438 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2913 transitions. Word has length 167 [2024-11-09 07:30:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:30:59,438 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2913 transitions. [2024-11-09 07:30:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 11 states have internal predecessors, (250), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:30:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2913 transitions. [2024-11-09 07:30:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2024-11-09 07:30:59,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:30:59,441 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, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:30:59,457 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-09 07:30:59,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:30:59,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:30:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:30:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash -197599741, now seen corresponding path program 1 times [2024-11-09 07:30:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:30:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487603437] [2024-11-09 07:30:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:30:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:30:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:31:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:31:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:02,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:31:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487603437] [2024-11-09 07:31:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487603437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:31:02,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624632445] [2024-11-09 07:31:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:02,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:31:02,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:31:02,392 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-09 07:31:02,393 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-09 07:31:02,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:02,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 1903 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:31:02,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:02,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:31:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:03,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:03,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:03,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:03,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:31:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:03,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624632445] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:03,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:31:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 21 [2024-11-09 07:31:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709418896] [2024-11-09 07:31:03,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:31:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:31:03,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:31:03,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:31:03,705 INFO L87 Difference]: Start difference. First operand 1695 states and 2913 transitions. Second operand has 21 states, 21 states have (on average 33.904761904761905) internal successors, (712), 20 states have internal predecessors, (712), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:31:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:15,490 INFO L93 Difference]: Finished difference Result 9336 states and 17102 transitions. [2024-11-09 07:31:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:31:15,491 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 33.904761904761905) internal successors, (712), 20 states have internal predecessors, (712), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 395 [2024-11-09 07:31:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:15,509 INFO L225 Difference]: With dead ends: 9336 [2024-11-09 07:31:15,510 INFO L226 Difference]: Without dead ends: 9336 [2024-11-09 07:31:15,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 785 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2024-11-09 07:31:15,511 INFO L432 NwaCegarLoop]: 1879 mSDtfsCounter, 14662 mSDsluCounter, 18345 mSDsCounter, 0 mSdLazyCounter, 11849 mSolverCounterSat, 5282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17686 SdHoareTripleChecker+Valid, 20224 SdHoareTripleChecker+Invalid, 17131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5282 IncrementalHoareTripleChecker+Valid, 11849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:15,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17686 Valid, 20224 Invalid, 17131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5282 Valid, 11849 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-11-09 07:31:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9336 states. [2024-11-09 07:31:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9336 to 2523. [2024-11-09 07:31:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2004 states have (on average 1.4895209580838322) internal successors, (2985), 2506 states have internal predecessors, (2985), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-09 07:31:16,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 4011 transitions. [2024-11-09 07:31:16,100 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 4011 transitions. Word has length 395 [2024-11-09 07:31:16,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:16,101 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 4011 transitions. [2024-11-09 07:31:16,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 33.904761904761905) internal successors, (712), 20 states have internal predecessors, (712), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 07:31:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 4011 transitions. [2024-11-09 07:31:16,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2024-11-09 07:31:16,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:16,112 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, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:16,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:31:16,313 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,SelfDestructingSolverStorable10 [2024-11-09 07:31:16,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:16,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2127414383, now seen corresponding path program 2 times [2024-11-09 07:31:16,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:31:16,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287716423] [2024-11-09 07:31:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:31:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:31:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:25,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:31:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:25,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:31:25,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287716423] [2024-11-09 07:31:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287716423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:31:25,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458035320] [2024-11-09 07:31:25,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:31:25,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:31:25,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:31:25,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:31:25,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:31:26,246 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:31:26,246 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:31:26,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:31:26,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:26,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:31:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3426 trivial. 0 not checked. [2024-11-09 07:31:26,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:31:26,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458035320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:31:26,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:31:26,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [26] total 33 [2024-11-09 07:31:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063088160] [2024-11-09 07:31:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:31:26,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:31:26,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:31:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:31:26,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 07:31:26,797 INFO L87 Difference]: Start difference. First operand 2523 states and 4011 transitions. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:31:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:31:29,236 INFO L93 Difference]: Finished difference Result 3631 states and 6154 transitions. [2024-11-09 07:31:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:31:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 851 [2024-11-09 07:31:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:31:29,244 INFO L225 Difference]: With dead ends: 3631 [2024-11-09 07:31:29,244 INFO L226 Difference]: Without dead ends: 3631 [2024-11-09 07:31:29,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=385, Invalid=1175, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 07:31:29,245 INFO L432 NwaCegarLoop]: 2461 mSDtfsCounter, 1327 mSDsluCounter, 9392 mSDsCounter, 0 mSdLazyCounter, 2892 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 11853 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:31:29,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 11853 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2892 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 07:31:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2024-11-09 07:31:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 2552. [2024-11-09 07:31:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2033 states have (on average 1.4825381210034432) internal successors, (3014), 2535 states have internal predecessors, (3014), 514 states have call successors, (514), 4 states have call predecessors, (514), 3 states have return successors, (512), 13 states have call predecessors, (512), 512 states have call successors, (512) [2024-11-09 07:31:29,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 4040 transitions. [2024-11-09 07:31:29,423 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 4040 transitions. Word has length 851 [2024-11-09 07:31:29,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:31:29,424 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 4040 transitions. [2024-11-09 07:31:29,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:31:29,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 4040 transitions. [2024-11-09 07:31:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-09 07:31:29,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:31:29,438 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, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:31:29,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:31:29,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:31:29,642 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:31:29,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:31:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1342271983, now seen corresponding path program 1 times [2024-11-09 07:31:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:31:29,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419253046] [2024-11-09 07:31:29,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:29,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:31:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 07:31:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:38,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 07:31:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:31:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419253046] [2024-11-09 07:31:38,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419253046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:31:38,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325533845] [2024-11-09 07:31:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:31:38,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:31:38,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:31:38,496 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:31:38,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:31:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:31:39,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 4166 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:31:39,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:31:39,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:31:39,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:39,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:39,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-11-09 07:31:40,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:31:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:40,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:31:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:31:41,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325533845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:41,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:31:41,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 15, 14] total 39 [2024-11-09 07:31:41,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457272844] [2024-11-09 07:31:41,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:31:41,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 07:31:41,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:31:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 07:31:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=573, Invalid=909, Unknown=0, NotChecked=0, Total=1482 [2024-11-09 07:31:41,471 INFO L87 Difference]: Start difference. First operand 2552 states and 4040 transitions. Second operand has 39 states, 39 states have (on average 41.97435897435897) internal successors, (1637), 38 states have internal predecessors, (1637), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)