./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.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 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:01:52,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:01:52,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:01:52,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:01:52,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:01:52,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:01:52,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:01:52,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:01:52,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:01:52,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:01:52,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:01:52,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:01:52,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:01:52,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:01:52,920 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:01:52,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:01:52,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:01:52,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:01:52,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:01:52,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:01:52,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:01:52,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:01:52,922 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:01:52,923 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:01:52,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:01:52,923 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:01:52,923 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:01:52,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:01:52,924 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:01:52,924 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:01:52,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:01:52,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:01:52,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:01:52,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:01:52,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:01:52,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:01:52,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:01:52,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:01:52,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:01:52,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:01:52,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:01:52,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:01:52,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:01:52,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:01:52,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:01:52,929 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2024-11-17 00:01:53,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:01:53,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:01:53,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:01:53,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:01:53,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:01:53,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-11-17 00:01:54,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:01:55,073 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:01:55,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-11-17 00:01:55,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597f3ee2d/b14c3d79e96549399e37d1577608e640/FLAG4e54741fe [2024-11-17 00:01:55,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/597f3ee2d/b14c3d79e96549399e37d1577608e640 [2024-11-17 00:01:55,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:01:55,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:01:55,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:01:55,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:01:55,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:01:55,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:01:55" (1/1) ... [2024-11-17 00:01:55,137 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404e1e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:55, skipping insertion in model container [2024-11-17 00:01:55,137 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:01:55" (1/1) ... [2024-11-17 00:01:55,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:01:55,912 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,939 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,943 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,949 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,955 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,994 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,996 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,998 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:55,999 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:56,001 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:56,005 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:56,007 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:56,008 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:56,008 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:56,011 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:56,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:01:56,041 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 00:01:56,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@f889b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:56, skipping insertion in model container [2024-11-17 00:01:56,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:01:56,042 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:01:56,044 INFO L158 Benchmark]: Toolchain (without parser) took 916.30ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 102.0MB in the end (delta: -14.5MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-17 00:01:56,045 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:01:56,045 INFO L158 Benchmark]: CACSL2BoogieTranslator took 914.06ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 102.0MB in the end (delta: -14.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-17 00:01:56,046 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 914.06ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 102.0MB in the end (delta: -14.7MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_FNV_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.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 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:01:58,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:01:58,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:01:58,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:01:58,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:01:58,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:01:58,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:01:58,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:01:58,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:01:58,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:01:58,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:01:58,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:01:58,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:01:58,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:01:58,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:01:58,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:01:58,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:01:58,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:01:58,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:01:58,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:01:58,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:01:58,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:01:58,239 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:01:58,239 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:01:58,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:01:58,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:01:58,240 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:01:58,240 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:01:58,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:01:58,241 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:01:58,241 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:01:58,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:01:58,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:01:58,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:01:58,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:01:58,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:01:58,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:01:58,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:01:58,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:01:58,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:01:58,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:01:58,245 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:01:58,245 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:01:58,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:01:58,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:01:58,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:01:58,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:01:58,246 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 -> 9c302c0a70f15041d912ede4a343504399632b0722d257e8570893a260b2b8dc [2024-11-17 00:01:58,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:01:58,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:01:58,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:01:58,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:01:58,602 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:01:58,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-11-17 00:02:00,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:02:00,624 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:02:00,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test9-2.i [2024-11-17 00:02:00,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12c6e75f/90d65830d26349fe9de01d63d6b5d5ae/FLAG22dfc38a4 [2024-11-17 00:02:00,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a12c6e75f/90d65830d26349fe9de01d63d6b5d5ae [2024-11-17 00:02:00,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:02:00,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:02:00,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:02:00,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:02:00,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:02:00,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:02:00" (1/1) ... [2024-11-17 00:02:00,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7107fbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:00, skipping insertion in model container [2024-11-17 00:02:00,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:02:00" (1/1) ... [2024-11-17 00:02:00,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:02:01,392 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,432 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,438 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,443 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,454 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,485 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,485 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,488 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,489 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,491 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,494 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,499 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,500 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,505 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:02:01,526 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:02:01,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:02:01,648 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,658 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,660 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,662 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,667 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,699 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,701 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,706 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,707 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,708 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,710 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,711 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,712 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,713 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,717 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:02:01,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:02:01,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:02:01,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:02:01,917 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:02:01,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01 WrapperNode [2024-11-17 00:02:01,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:02:01,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:02:01,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:02:01,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:02:01,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:01,982 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,088 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3008 [2024-11-17 00:02:02,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:02:02,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:02:02,091 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:02:02,091 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:02:02,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,232 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-17 00:02:02,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:02:02,366 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:02:02,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:02:02,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:02:02,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (1/1) ... [2024-11-17 00:02:02,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:02:02,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:02:02,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:02:02,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:02:02,501 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:02:02,502 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:02:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:02:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:02:02,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:02:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:02:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:02:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:02:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:02:02,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:02:02,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:02:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:02:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:02:02,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:02:02,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:02:02,504 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:02:02,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:02:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:02:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:02:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:02:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:02:02,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:02:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:02:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:02:02,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:02:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:02:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:02:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:02:02,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:02:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:02:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:02:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:02:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:02:02,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:02:02,765 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:02:02,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:02:12,711 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:02:12,968 INFO L? ?]: Removed 637 outVars from TransFormulas that were not future-live. [2024-11-17 00:02:12,968 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:02:13,021 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:02:13,021 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:02:13,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:02:13 BoogieIcfgContainer [2024-11-17 00:02:13,022 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:02:13,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:02:13,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:02:13,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:02:13,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:02:00" (1/3) ... [2024-11-17 00:02:13,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712fb820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:02:13, skipping insertion in model container [2024-11-17 00:02:13,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:02:01" (2/3) ... [2024-11-17 00:02:13,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712fb820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:02:13, skipping insertion in model container [2024-11-17 00:02:13,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:02:13" (3/3) ... [2024-11-17 00:02:13,030 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test9-2.i [2024-11-17 00:02:13,046 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:02:13,046 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:02:13,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:02:13,146 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;@22115033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:02:13,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:02:13,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 1213 states, 702 states have (on average 1.8945868945868947) internal successors, (1330), 1206 states have internal predecessors, (1330), 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-17 00:02:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:02:13,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:13,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:02:13,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:13,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -224342327, now seen corresponding path program 1 times [2024-11-17 00:02:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:13,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741225980] [2024-11-17 00:02:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:13,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:13,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:13,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:13,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:02:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:13,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:02:13,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:02:13,421 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:13,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741225980] [2024-11-17 00:02:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741225980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:13,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:02:13,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966828096] [2024-11-17 00:02:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:13,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:02:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:13,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:02:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:02:13,467 INFO L87 Difference]: Start difference. First operand has 1213 states, 702 states have (on average 1.8945868945868947) internal successors, (1330), 1206 states have internal predecessors, (1330), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:02:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:13,685 INFO L93 Difference]: Finished difference Result 1211 states and 2268 transitions. [2024-11-17 00:02:13,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:02:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:02:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:13,714 INFO L225 Difference]: With dead ends: 1211 [2024-11-17 00:02:13,714 INFO L226 Difference]: Without dead ends: 1208 [2024-11-17 00:02:13,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:02:13,719 INFO L432 NwaCegarLoop]: 2268 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, 2268 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-17 00:02:13,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:02:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-11-17 00:02:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2024-11-17 00:02:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 699 states have (on average 1.798283261802575) internal successors, (1257), 1201 states have internal predecessors, (1257), 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-17 00:02:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 2265 transitions. [2024-11-17 00:02:14,153 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 2265 transitions. Word has length 11 [2024-11-17 00:02:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:14,154 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 2265 transitions. [2024-11-17 00:02:14,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:02:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2265 transitions. [2024-11-17 00:02:14,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:02:14,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:14,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:02:14,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 00:02:14,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:14,358 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:14,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:14,359 INFO L85 PathProgramCache]: Analyzing trace with hash -486100604, now seen corresponding path program 1 times [2024-11-17 00:02:14,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:14,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60610030] [2024-11-17 00:02:14,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:14,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:14,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:14,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:14,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:02:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:14,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:02:14,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:02:14,607 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:14,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:14,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60610030] [2024-11-17 00:02:14,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60610030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:14,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:02:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900930196] [2024-11-17 00:02:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:14,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:02:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:14,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:02:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:02:14,611 INFO L87 Difference]: Start difference. First operand 1208 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:02:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:15,480 INFO L93 Difference]: Finished difference Result 2333 states and 4426 transitions. [2024-11-17 00:02:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:02:15,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-17 00:02:15,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:15,496 INFO L225 Difference]: With dead ends: 2333 [2024-11-17 00:02:15,497 INFO L226 Difference]: Without dead ends: 2333 [2024-11-17 00:02:15,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:02:15,498 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 1151 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 4492 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:15,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 4492 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:02:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2024-11-17 00:02:15,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2300. [2024-11-17 00:02:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 1291 states have (on average 1.8404337722695585) internal successors, (2376), 2293 states have internal predecessors, (2376), 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-17 00:02:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 4384 transitions. [2024-11-17 00:02:15,827 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 4384 transitions. Word has length 15 [2024-11-17 00:02:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:15,828 INFO L471 AbstractCegarLoop]: Abstraction has 2300 states and 4384 transitions. [2024-11-17 00:02:15,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:02:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 4384 transitions. [2024-11-17 00:02:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:02:15,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:15,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:02:15,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:02:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:16,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:16,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash 401403077, now seen corresponding path program 1 times [2024-11-17 00:02:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:16,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377531845] [2024-11-17 00:02:16,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:16,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:16,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:16,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:16,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:02:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:16,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:02:16,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:16,264 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:02:16,265 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:02:16,266 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:02:16,275 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 30 treesize of output 39 [2024-11-17 00:02:16,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:02:16,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:02:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:02:16,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:16,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:16,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377531845] [2024-11-17 00:02:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377531845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:16,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:16,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:02:16,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799789676] [2024-11-17 00:02:16,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:16,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:02:16,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:16,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:02:16,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:02:16,370 INFO L87 Difference]: Start difference. First operand 2300 states and 4384 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:02:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:19,393 INFO L93 Difference]: Finished difference Result 4452 states and 8581 transitions. [2024-11-17 00:02:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:02:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-17 00:02:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:19,422 INFO L225 Difference]: With dead ends: 4452 [2024-11-17 00:02:19,423 INFO L226 Difference]: Without dead ends: 4452 [2024-11-17 00:02:19,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:02:19,424 INFO L432 NwaCegarLoop]: 2527 mSDtfsCounter, 1235 mSDsluCounter, 4265 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 6792 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:19,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 6792 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-17 00:02:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2024-11-17 00:02:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 2299. [2024-11-17 00:02:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 1290 states have (on average 1.84031007751938) internal successors, (2374), 2292 states have internal predecessors, (2374), 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-17 00:02:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 4382 transitions. [2024-11-17 00:02:19,984 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 4382 transitions. Word has length 15 [2024-11-17 00:02:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:19,985 INFO L471 AbstractCegarLoop]: Abstraction has 2299 states and 4382 transitions. [2024-11-17 00:02:19,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:02:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 4382 transitions. [2024-11-17 00:02:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:02:19,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:19,990 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] [2024-11-17 00:02:19,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-17 00:02:20,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:20,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:20,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:20,195 INFO L85 PathProgramCache]: Analyzing trace with hash 831220629, now seen corresponding path program 1 times [2024-11-17 00:02:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:20,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215541155] [2024-11-17 00:02:20,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:20,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:20,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:02:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:20,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:02:20,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-17 00:02:20,816 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:20,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:20,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215541155] [2024-11-17 00:02:20,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215541155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:20,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:20,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:02:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910415125] [2024-11-17 00:02:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:20,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:02:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:02:20,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:02:20,823 INFO L87 Difference]: Start difference. First operand 2299 states and 4382 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:02:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:21,057 INFO L93 Difference]: Finished difference Result 2305 states and 4372 transitions. [2024-11-17 00:02:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:02:21,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 87 [2024-11-17 00:02:21,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:21,076 INFO L225 Difference]: With dead ends: 2305 [2024-11-17 00:02:21,076 INFO L226 Difference]: Without dead ends: 2305 [2024-11-17 00:02:21,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:02:21,080 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 30 mSDsluCounter, 4450 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6685 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:21,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6685 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:02:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2024-11-17 00:02:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2024-11-17 00:02:21,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1296 states have (on average 1.8240740740740742) internal successors, (2364), 2298 states have internal predecessors, (2364), 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-17 00:02:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 4372 transitions. [2024-11-17 00:02:21,334 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 4372 transitions. Word has length 87 [2024-11-17 00:02:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:21,334 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 4372 transitions. [2024-11-17 00:02:21,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:02:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 4372 transitions. [2024-11-17 00:02:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:02:21,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:21,354 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] [2024-11-17 00:02:21,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 00:02:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:21,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:21,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash 500381724, now seen corresponding path program 1 times [2024-11-17 00:02:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827425977] [2024-11-17 00:02:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:21,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:21,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:21,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:21,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:02:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:21,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:02:21,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:02:21,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:22,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827425977] [2024-11-17 00:02:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827425977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:22,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:22,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:02:22,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054726823] [2024-11-17 00:02:22,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:22,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:02:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:02:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:02:22,005 INFO L87 Difference]: Start difference. First operand 2305 states and 4372 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:02:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:22,092 INFO L93 Difference]: Finished difference Result 2308 states and 4376 transitions. [2024-11-17 00:02:22,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:02:22,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-11-17 00:02:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:22,108 INFO L225 Difference]: With dead ends: 2308 [2024-11-17 00:02:22,109 INFO L226 Difference]: Without dead ends: 2308 [2024-11-17 00:02:22,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:02:22,111 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 0 mSDsluCounter, 4498 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6749 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:22,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6749 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:02:22,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2024-11-17 00:02:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2308. [2024-11-17 00:02:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 1298 states have (on average 1.8235747303543914) internal successors, (2367), 2301 states have internal predecessors, (2367), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-17 00:02:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 4376 transitions. [2024-11-17 00:02:22,577 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 4376 transitions. Word has length 87 [2024-11-17 00:02:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:22,579 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 4376 transitions. [2024-11-17 00:02:22,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:02:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 4376 transitions. [2024-11-17 00:02:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 00:02:22,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:22,582 INFO L215 NwaCegarLoop]: trace histogram [2, 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] [2024-11-17 00:02:22,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:02:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:22,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1116814848, now seen corresponding path program 1 times [2024-11-17 00:02:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551486034] [2024-11-17 00:02:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:22,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:22,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:22,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:22,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:02:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:23,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:02:23,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:02:23,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:02:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-17 00:02:23,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551486034] [2024-11-17 00:02:23,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551486034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:02:23,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:02:23,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:02:23,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204118388] [2024-11-17 00:02:23,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:02:23,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:02:23,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:23,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:02:23,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:02:23,421 INFO L87 Difference]: Start difference. First operand 2308 states and 4376 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:02:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:23,624 INFO L93 Difference]: Finished difference Result 2319 states and 4392 transitions. [2024-11-17 00:02:23,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:02:23,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-11-17 00:02:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:23,638 INFO L225 Difference]: With dead ends: 2319 [2024-11-17 00:02:23,638 INFO L226 Difference]: Without dead ends: 2319 [2024-11-17 00:02:23,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:02:23,639 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 5 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6752 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:23,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6752 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:02:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-17 00:02:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2317. [2024-11-17 00:02:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1306 states have (on average 1.8231240428790199) internal successors, (2381), 2309 states have internal predecessors, (2381), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-17 00:02:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 4390 transitions. [2024-11-17 00:02:23,941 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 4390 transitions. Word has length 89 [2024-11-17 00:02:23,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:23,941 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 4390 transitions. [2024-11-17 00:02:23,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:02:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 4390 transitions. [2024-11-17 00:02:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-17 00:02:23,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:23,948 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-11-17 00:02:23,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:02:24,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:24,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:24,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1792645188, now seen corresponding path program 2 times [2024-11-17 00:02:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511142281] [2024-11-17 00:02:24,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:02:24,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:24,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:24,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:24,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:02:24,456 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:02:24,456 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:02:24,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:02:24,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-17 00:02:24,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:24,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511142281] [2024-11-17 00:02:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511142281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:24,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:24,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:02:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308032207] [2024-11-17 00:02:24,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:24,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:02:24,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:02:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:02:24,539 INFO L87 Difference]: Start difference. First operand 2317 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:02:28,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:02:32,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:02:35,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:02:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:41,741 INFO L93 Difference]: Finished difference Result 3455 states and 6570 transitions. [2024-11-17 00:02:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:02:41,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 93 [2024-11-17 00:02:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:41,761 INFO L225 Difference]: With dead ends: 3455 [2024-11-17 00:02:41,762 INFO L226 Difference]: Without dead ends: 3455 [2024-11-17 00:02:41,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:02:41,763 INFO L432 NwaCegarLoop]: 2304 mSDtfsCounter, 3530 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 930 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4033 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 930 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:41,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4033 Valid, 4527 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [930 Valid, 622 Invalid, 2 Unknown, 0 Unchecked, 17.0s Time] [2024-11-17 00:02:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2024-11-17 00:02:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 3429. [2024-11-17 00:02:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 1917 states have (on average 1.8377673448095984) internal successors, (3523), 3420 states have internal predecessors, (3523), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:02:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 6535 transitions. [2024-11-17 00:02:42,220 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 6535 transitions. Word has length 93 [2024-11-17 00:02:42,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:42,220 INFO L471 AbstractCegarLoop]: Abstraction has 3429 states and 6535 transitions. [2024-11-17 00:02:42,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:02:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 6535 transitions. [2024-11-17 00:02:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 00:02:42,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:42,222 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 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] [2024-11-17 00:02:42,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 00:02:42,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:42,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:42,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:42,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1370164767, now seen corresponding path program 1 times [2024-11-17 00:02:42,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:42,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835663887] [2024-11-17 00:02:42,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:42,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:42,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:42,429 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:42,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:02:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:42,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:02:42,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:02:43,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:02:43,299 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:02:43,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:43,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835663887] [2024-11-17 00:02:43,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835663887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:02:43,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:02:43,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:02:43,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885476361] [2024-11-17 00:02:43,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:02:43,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:02:43,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:02:43,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:02:43,302 INFO L87 Difference]: Start difference. First operand 3429 states and 6535 transitions. Second operand has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:02:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:44,014 INFO L93 Difference]: Finished difference Result 3444 states and 6558 transitions. [2024-11-17 00:02:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:02:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2024-11-17 00:02:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:44,039 INFO L225 Difference]: With dead ends: 3444 [2024-11-17 00:02:44,039 INFO L226 Difference]: Without dead ends: 3440 [2024-11-17 00:02:44,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:02:44,040 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 8 mSDsluCounter, 15741 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17992 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:44,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17992 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:02:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2024-11-17 00:02:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3438. [2024-11-17 00:02:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 1926 states have (on average 1.835410176531672) internal successors, (3535), 3429 states have internal predecessors, (3535), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:02:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 6547 transitions. [2024-11-17 00:02:44,457 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 6547 transitions. Word has length 103 [2024-11-17 00:02:44,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:44,458 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 6547 transitions. [2024-11-17 00:02:44,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:02:44,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 6547 transitions. [2024-11-17 00:02:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-17 00:02:44,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:44,459 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 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] [2024-11-17 00:02:44,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 00:02:44,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:44,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:44,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash 950298488, now seen corresponding path program 2 times [2024-11-17 00:02:44,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:44,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396527476] [2024-11-17 00:02:44,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:02:44,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:44,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:44,663 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:44,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:02:44,984 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:02:44,984 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:02:44,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:02:44,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:45,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:02:45,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:02:45,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:02:45,015 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 30 treesize of output 39 [2024-11-17 00:02:45,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:02:45,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:02:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-17 00:02:45,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:45,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396527476] [2024-11-17 00:02:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396527476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:45,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:45,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:02:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643215564] [2024-11-17 00:02:45,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:45,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:02:45,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:45,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:02:45,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:02:45,114 INFO L87 Difference]: Start difference. First operand 3438 states and 6547 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:02:47,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:47,745 INFO L93 Difference]: Finished difference Result 6624 states and 12787 transitions. [2024-11-17 00:02:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:02:47,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 112 [2024-11-17 00:02:47,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:47,792 INFO L225 Difference]: With dead ends: 6624 [2024-11-17 00:02:47,793 INFO L226 Difference]: Without dead ends: 6624 [2024-11-17 00:02:47,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:02:47,794 INFO L432 NwaCegarLoop]: 2595 mSDtfsCounter, 1181 mSDsluCounter, 4322 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 6917 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:47,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 6917 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-17 00:02:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6624 states. [2024-11-17 00:02:48,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6624 to 3442. [2024-11-17 00:02:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 1930 states have (on average 1.8336787564766839) internal successors, (3539), 3433 states have internal predecessors, (3539), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:02:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 6551 transitions. [2024-11-17 00:02:48,639 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 6551 transitions. Word has length 112 [2024-11-17 00:02:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:48,639 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 6551 transitions. [2024-11-17 00:02:48,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:02:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 6551 transitions. [2024-11-17 00:02:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-17 00:02:48,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:48,641 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-11-17 00:02:48,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:02:48,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:48,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:48,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -171855453, now seen corresponding path program 1 times [2024-11-17 00:02:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598587187] [2024-11-17 00:02:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:48,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:48,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:48,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:48,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:02:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:49,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:02:49,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:02:49,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:02:50,450 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:02:50,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:50,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598587187] [2024-11-17 00:02:50,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598587187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:02:50,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:02:50,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:02:50,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940582550] [2024-11-17 00:02:50,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:02:50,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:02:50,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:02:50,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:02:50,453 INFO L87 Difference]: Start difference. First operand 3442 states and 6551 transitions. Second operand has 26 states, 26 states have (on average 5.884615384615385) internal successors, (153), 26 states have internal predecessors, (153), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:02:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:52,843 INFO L93 Difference]: Finished difference Result 3466 states and 6592 transitions. [2024-11-17 00:02:52,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:02:52,845 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.884615384615385) internal successors, (153), 26 states have internal predecessors, (153), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 145 [2024-11-17 00:02:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:52,858 INFO L225 Difference]: With dead ends: 3466 [2024-11-17 00:02:52,858 INFO L226 Difference]: Without dead ends: 3462 [2024-11-17 00:02:52,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:02:52,860 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 14 mSDsluCounter, 24743 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26994 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:52,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26994 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 00:02:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2024-11-17 00:02:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3460. [2024-11-17 00:02:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 1948 states have (on average 1.8290554414784395) internal successors, (3563), 3451 states have internal predecessors, (3563), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:02:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 6575 transitions. [2024-11-17 00:02:53,297 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 6575 transitions. Word has length 145 [2024-11-17 00:02:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:53,297 INFO L471 AbstractCegarLoop]: Abstraction has 3460 states and 6575 transitions. [2024-11-17 00:02:53,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.884615384615385) internal successors, (153), 26 states have internal predecessors, (153), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:02:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 6575 transitions. [2024-11-17 00:02:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-17 00:02:53,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:53,300 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-11-17 00:02:53,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:02:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:53,501 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:53,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -280829821, now seen corresponding path program 2 times [2024-11-17 00:02:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623687519] [2024-11-17 00:02:53,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:02:53,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:53,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:53,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:02:53,894 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:02:53,895 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:02:53,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:02:53,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-17 00:02:53,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:53,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:53,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623687519] [2024-11-17 00:02:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623687519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:53,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:02:53,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819594236] [2024-11-17 00:02:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:53,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:02:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:02:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:02:53,934 INFO L87 Difference]: Start difference. First operand 3460 states and 6575 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-17 00:02:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:54,097 INFO L93 Difference]: Finished difference Result 3469 states and 6560 transitions. [2024-11-17 00:02:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:02:54,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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 163 [2024-11-17 00:02:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:54,116 INFO L225 Difference]: With dead ends: 3469 [2024-11-17 00:02:54,117 INFO L226 Difference]: Without dead ends: 3469 [2024-11-17 00:02:54,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:02:54,118 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 30 mSDsluCounter, 4428 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6652 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:54,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6652 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:02:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2024-11-17 00:02:54,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3469. [2024-11-17 00:02:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 1957 states have (on average 1.8129790495656617) internal successors, (3548), 3460 states have internal predecessors, (3548), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:02:54,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 6560 transitions. [2024-11-17 00:02:54,486 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 6560 transitions. Word has length 163 [2024-11-17 00:02:54,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:54,487 INFO L471 AbstractCegarLoop]: Abstraction has 3469 states and 6560 transitions. [2024-11-17 00:02:54,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-17 00:02:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 6560 transitions. [2024-11-17 00:02:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-17 00:02:54,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:54,489 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-11-17 00:02:54,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 00:02:54,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:54,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:54,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1122073782, now seen corresponding path program 1 times [2024-11-17 00:02:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833893549] [2024-11-17 00:02:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:02:54,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:54,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:54,693 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:54,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:02:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:02:55,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:02:55,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 00:02:56,417 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:02:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-17 00:02:59,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:59,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833893549] [2024-11-17 00:02:59,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833893549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:02:59,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:02:59,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:02:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358487270] [2024-11-17 00:02:59,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:02:59,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:02:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:59,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:02:59,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:02:59,261 INFO L87 Difference]: Start difference. First operand 3469 states and 6560 transitions. Second operand has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:03:08,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:03:08,431 INFO L93 Difference]: Finished difference Result 3509 states and 6633 transitions. [2024-11-17 00:03:08,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:03:08,432 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 163 [2024-11-17 00:03:08,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:03:08,441 INFO L225 Difference]: With dead ends: 3509 [2024-11-17 00:03:08,441 INFO L226 Difference]: Without dead ends: 3505 [2024-11-17 00:03:08,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:03:08,445 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 26 mSDsluCounter, 53712 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55952 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:03:08,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55952 Invalid, 2016 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-17 00:03:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2024-11-17 00:03:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 3503. [2024-11-17 00:03:08,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 1991 states have (on average 1.8051230537418383) internal successors, (3594), 3494 states have internal predecessors, (3594), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:03:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 6606 transitions. [2024-11-17 00:03:08,836 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 6606 transitions. Word has length 163 [2024-11-17 00:03:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:03:08,837 INFO L471 AbstractCegarLoop]: Abstraction has 3503 states and 6606 transitions. [2024-11-17 00:03:08,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:03:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 6606 transitions. [2024-11-17 00:03:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-17 00:03:08,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:03:08,839 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-11-17 00:03:08,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-17 00:03:09,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:03:09,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:03:09,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:03:09,042 INFO L85 PathProgramCache]: Analyzing trace with hash -230465878, now seen corresponding path program 2 times [2024-11-17 00:03:09,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:03:09,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806578309] [2024-11-17 00:03:09,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:03:09,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:03:09,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:03:09,047 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:03:09,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:03:10,425 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:03:10,425 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:03:10,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:03:10,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:03:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:03:11,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:03:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:03:13,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:03:13,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806578309] [2024-11-17 00:03:13,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806578309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:03:13,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:03:13,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:03:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959709197] [2024-11-17 00:03:13,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:03:13,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:03:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:03:13,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:03:13,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:03:13,282 INFO L87 Difference]: Start difference. First operand 3503 states and 6606 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)