./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-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 d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:07:15,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:07:15,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 13:07:15,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:07:15,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:07:16,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:07:16,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:07:16,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:07:16,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:07:16,018 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:07:16,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:07:16,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:07:16,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:07:16,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:07:16,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:07:16,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:07:16,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 13:07:16,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:07:16,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:07:16,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:07:16,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:07:16,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 13:07:16,027 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:07:16,027 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:07:16,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:07:16,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 13:07:16,027 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:07:16,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:07:16,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:07:16,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:07:16,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 13:07:16,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:07:16,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:07:16,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:07:16,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:07:16,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:07:16,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:07:16,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:07:16,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:07:16,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:07:16,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:07:16,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:07:16,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:07:16,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:07:16,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:07:16,037 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 -> d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d [2024-11-12 13:07:16,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:07:16,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:07:16,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:07:16,333 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:07:16,334 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:07:16,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2024-11-12 13:07:17,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:07:18,145 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:07:18,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2024-11-12 13:07:18,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2263d38/7ea81f9b5239427a9ba56bc1ac99f627/FLAG0b7313e6f [2024-11-12 13:07:18,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2263d38/7ea81f9b5239427a9ba56bc1ac99f627 [2024-11-12 13:07:18,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:07:18,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:07:18,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:07:18,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:07:18,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:07:18,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:07:18" (1/1) ... [2024-11-12 13:07:18,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ddcc69b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:18, skipping insertion in model container [2024-11-12 13:07:18,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:07:18" (1/1) ... [2024-11-12 13:07:18,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:07:18,708 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,750 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,756 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,796 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,862 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,863 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,865 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,865 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,870 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,871 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,872 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,873 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,877 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,878 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,882 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,884 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,886 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,888 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,892 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:18,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:07:18,915 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-12 13:07:18,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@31a37491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:18, skipping insertion in model container [2024-11-12 13:07:18,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:07:18,916 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 13:07:18,920 INFO L158 Benchmark]: Toolchain (without parser) took 715.98ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 123.3MB in the end (delta: -36.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 13:07:18,921 INFO L158 Benchmark]: CDTParser took 1.10ms. Allocated memory is still 117.4MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:07:18,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.21ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 123.3MB in the end (delta: -36.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 13:07:18,923 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10ms. Allocated memory is still 117.4MB. Free memory is still 76.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.21ms. Allocated memory is still 159.4MB. Free memory was 86.6MB in the beginning and 123.3MB in the end (delta: -36.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: 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_SFH_test3-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 d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:07:21,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:07:21,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-12 13:07:21,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:07:21,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:07:21,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:07:21,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:07:21,204 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:07:21,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:07:21,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:07:21,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:07:21,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:07:21,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:07:21,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:07:21,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:07:21,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:07:21,210 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 13:07:21,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:07:21,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:07:21,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:07:21,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:07:21,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 13:07:21,214 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:07:21,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:07:21,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:07:21,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 13:07:21,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:07:21,216 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 13:07:21,216 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:07:21,216 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 13:07:21,217 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:07:21,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:07:21,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 13:07:21,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:07:21,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:07:21,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:07:21,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:07:21,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:07:21,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:07:21,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:07:21,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:07:21,225 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 13:07:21,225 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 13:07:21,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:07:21,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:07:21,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:07:21,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:07:21,226 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 -> d11f955236406002afd026860cf5cae6834e26918579de44c447a4ac30cb678d [2024-11-12 13:07:21,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:07:21,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:07:21,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:07:21,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:07:21,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:07:21,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2024-11-12 13:07:23,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:07:23,648 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:07:23,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test3-2.i [2024-11-12 13:07:23,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94418a15c/34f9e2aeeb1d4969934b64195487bb3b/FLAG0e2cae0e9 [2024-11-12 13:07:23,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94418a15c/34f9e2aeeb1d4969934b64195487bb3b [2024-11-12 13:07:23,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:07:23,697 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:07:23,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:07:23,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:07:23,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:07:23,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:07:23" (1/1) ... [2024-11-12 13:07:23,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea9655b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:23, skipping insertion in model container [2024-11-12 13:07:23,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:07:23" (1/1) ... [2024-11-12 13:07:23,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:07:24,233 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,267 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,272 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,277 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,287 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,327 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,328 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,330 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,331 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,335 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,341 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,343 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,344 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,357 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,359 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,365 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,366 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,371 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,372 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,380 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:07:24,414 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 13:07:24,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:07:24,446 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,459 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,462 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,467 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,492 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,503 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,509 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,511 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,512 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,513 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,517 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,519 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,520 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,521 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,525 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:07:24,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:07:24,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:07:24,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:07:24,670 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:07:24,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24 WrapperNode [2024-11-12 13:07:24,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:07:24,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:07:24,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:07:24,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:07:24,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,816 INFO L138 Inliner]: procedures = 180, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1208 [2024-11-12 13:07:24,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:07:24,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:07:24,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:07:24,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:07:24,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,842 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,935 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 267, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-12 13:07:24,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:24,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:25,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:25,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:25,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:07:25,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:07:25,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:07:25,052 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:07:25,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (1/1) ... [2024-11-12 13:07:25,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:07:25,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:07:25,089 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-12 13:07:25,091 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-12 13:07:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 13:07:25,131 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 13:07:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 13:07:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 13:07:25,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 13:07:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 13:07:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 13:07:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 13:07:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 13:07:25,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 13:07:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 13:07:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 13:07:25,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 13:07:25,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 13:07:25,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 13:07:25,133 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 13:07:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:07:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:07:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:07:25,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 13:07:25,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 13:07:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 13:07:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 13:07:25,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:07:25,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:07:25,386 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:07:25,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:07:33,298 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2024-11-12 13:07:33,299 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:07:33,326 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:07:33,328 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-12 13:07:33,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:07:33 BoogieIcfgContainer [2024-11-12 13:07:33,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:07:33,331 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:07:33,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:07:33,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:07:33,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:07:23" (1/3) ... [2024-11-12 13:07:33,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67da71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:07:33, skipping insertion in model container [2024-11-12 13:07:33,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:07:24" (2/3) ... [2024-11-12 13:07:33,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67da71e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:07:33, skipping insertion in model container [2024-11-12 13:07:33,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:07:33" (3/3) ... [2024-11-12 13:07:33,340 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test3-2.i [2024-11-12 13:07:33,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:07:33,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 13:07:33,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:07:33,430 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;@72aee199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:07:33,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 13:07:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 228 states have (on average 1.662280701754386) internal successors, (379), 237 states have internal predecessors, (379), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:07:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:07:33,442 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:33,443 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:33,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1668413064, now seen corresponding path program 1 times [2024-11-12 13:07:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847435110] [2024-11-12 13:07:33,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:33,462 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-12 13:07:33,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:33,464 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-12 13:07:33,487 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-12 13:07:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:33,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 13:07:33,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:33,688 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-12 13:07:33,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:33,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:33,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847435110] [2024-11-12 13:07:33,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847435110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:33,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:33,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:07:33,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730776133] [2024-11-12 13:07:33,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:33,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:07:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:33,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:07:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:07:33,747 INFO L87 Difference]: Start difference. First operand has 244 states, 228 states have (on average 1.662280701754386) internal successors, (379), 237 states have internal predecessors, (379), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 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-12 13:07:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:33,792 INFO L93 Difference]: Finished difference Result 242 states and 318 transitions. [2024-11-12 13:07:33,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:07:33,795 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-12 13:07:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:33,808 INFO L225 Difference]: With dead ends: 242 [2024-11-12 13:07:33,809 INFO L226 Difference]: Without dead ends: 240 [2024-11-12 13:07:33,810 INFO L434 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-12 13:07:33,816 INFO L435 NwaCegarLoop]: 318 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, 318 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-12 13:07:33,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:07:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-12 13:07:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-11-12 13:07:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 226 states have (on average 1.3185840707964602) internal successors, (298), 233 states have internal predecessors, (298), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 13:07:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 316 transitions. [2024-11-12 13:07:33,957 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 316 transitions. Word has length 11 [2024-11-12 13:07:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:33,958 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 316 transitions. [2024-11-12 13:07:33,958 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-12 13:07:33,958 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 316 transitions. [2024-11-12 13:07:33,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-12 13:07:33,960 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:33,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:33,967 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-12 13:07:34,161 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-12 13:07:34,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:34,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -13078323, now seen corresponding path program 1 times [2024-11-12 13:07:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799596808] [2024-11-12 13:07:34,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:34,164 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-12 13:07:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:34,166 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-12 13:07:34,167 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-12 13:07:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:34,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:07:34,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:34,534 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-12 13:07:34,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:34,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:34,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799596808] [2024-11-12 13:07:34,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799596808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:34,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:34,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:34,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202682259] [2024-11-12 13:07:34,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:34,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:34,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:34,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:34,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:34,545 INFO L87 Difference]: Start difference. First operand 240 states and 316 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:07:39,206 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-12 13:07:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:41,127 INFO L93 Difference]: Finished difference Result 387 states and 507 transitions. [2024-11-12 13:07:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:07:41,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-12 13:07:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:41,134 INFO L225 Difference]: With dead ends: 387 [2024-11-12 13:07:41,135 INFO L226 Difference]: Without dead ends: 387 [2024-11-12 13:07:41,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-12 13:07:41,136 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 182 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:41,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 889 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-11-12 13:07:41,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-12 13:07:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 354. [2024-11-12 13:07:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 340 states have (on average 1.3147058823529412) internal successors, (447), 347 states have internal predecessors, (447), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 13:07:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 465 transitions. [2024-11-12 13:07:41,166 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 465 transitions. Word has length 16 [2024-11-12 13:07:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:41,167 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 465 transitions. [2024-11-12 13:07:41,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:07:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 465 transitions. [2024-11-12 13:07:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 13:07:41,168 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:41,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:41,176 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-12 13:07:41,368 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-12 13:07:41,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:41,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash 807680616, now seen corresponding path program 1 times [2024-11-12 13:07:41,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619233372] [2024-11-12 13:07:41,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:41,370 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-12 13:07:41,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:41,374 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-12 13:07:41,379 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-12 13:07:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:41,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:07:41,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:41,612 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:41,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:41,614 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:41,624 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-12 13:07:41,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:07:41,729 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-12 13:07:41,757 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-12 13:07:41,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:41,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619233372] [2024-11-12 13:07:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619233372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:41,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:41,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931193708] [2024-11-12 13:07:41,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:41,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:41,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:41,760 INFO L87 Difference]: Start difference. First operand 354 states and 465 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-12 13:07:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:42,380 INFO L93 Difference]: Finished difference Result 560 states and 743 transitions. [2024-11-12 13:07:42,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:07:42,382 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-12 13:07:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:42,386 INFO L225 Difference]: With dead ends: 560 [2024-11-12 13:07:42,386 INFO L226 Difference]: Without dead ends: 560 [2024-11-12 13:07:42,386 INFO L434 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-12 13:07:42,388 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 277 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:42,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 932 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:07:42,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-12 13:07:42,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 353. [2024-11-12 13:07:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 339 states have (on average 1.3126843657817109) internal successors, (445), 346 states have internal predecessors, (445), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 13:07:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 463 transitions. [2024-11-12 13:07:42,430 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 463 transitions. Word has length 15 [2024-11-12 13:07:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:42,430 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 463 transitions. [2024-11-12 13:07:42,430 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-12 13:07:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 463 transitions. [2024-11-12 13:07:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 13:07:42,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:42,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:42,440 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 13:07:42,634 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-12 13:07:42,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:42,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 569100510, now seen corresponding path program 1 times [2024-11-12 13:07:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:42,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472118511] [2024-11-12 13:07:42,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:42,637 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-12 13:07:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:42,640 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-12 13:07:42,642 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-12 13:07:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:43,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:07:43,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:43,213 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-12 13:07:43,214 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:43,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472118511] [2024-11-12 13:07:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472118511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:43,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:43,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650750173] [2024-11-12 13:07:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:43,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:43,217 INFO L87 Difference]: Start difference. First operand 353 states and 463 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:07:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:43,413 INFO L93 Difference]: Finished difference Result 359 states and 453 transitions. [2024-11-12 13:07:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:07:43,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-12 13:07:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:43,416 INFO L225 Difference]: With dead ends: 359 [2024-11-12 13:07:43,416 INFO L226 Difference]: Without dead ends: 359 [2024-11-12 13:07:43,416 INFO L434 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-12 13:07:43,417 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 30 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 839 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-12 13:07:43,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 839 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:07:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-12 13:07:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-11-12 13:07:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 345 states have (on average 1.2608695652173914) internal successors, (435), 352 states have internal predecessors, (435), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 13:07:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 453 transitions. [2024-11-12 13:07:43,445 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 453 transitions. Word has length 87 [2024-11-12 13:07:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:43,445 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 453 transitions. [2024-11-12 13:07:43,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:07:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 453 transitions. [2024-11-12 13:07:43,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 13:07:43,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:43,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:43,467 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-12 13:07:43,654 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-12 13:07:43,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:43,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2031074990, now seen corresponding path program 1 times [2024-11-12 13:07:43,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:43,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967923306] [2024-11-12 13:07:43,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:43,657 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-12 13:07:43,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:43,661 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-12 13:07:43,662 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-12 13:07:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:44,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:07:44,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:44,207 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-12 13:07:44,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:44,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:44,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967923306] [2024-11-12 13:07:44,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967923306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:44,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:44,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:44,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809335619] [2024-11-12 13:07:44,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:44,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:44,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:44,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:44,211 INFO L87 Difference]: Start difference. First operand 359 states and 453 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:07:44,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:44,267 INFO L93 Difference]: Finished difference Result 362 states and 457 transitions. [2024-11-12 13:07:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:07:44,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-11-12 13:07:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:44,270 INFO L225 Difference]: With dead ends: 362 [2024-11-12 13:07:44,271 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 13:07:44,271 INFO L434 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-12 13:07:44,272 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 902 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-12 13:07:44,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 902 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:07:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 13:07:44,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2024-11-12 13:07:44,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 347 states have (on average 1.2622478386167146) internal successors, (438), 355 states have internal predecessors, (438), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:07:44,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 457 transitions. [2024-11-12 13:07:44,283 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 457 transitions. Word has length 87 [2024-11-12 13:07:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:44,284 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 457 transitions. [2024-11-12 13:07:44,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:07:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 457 transitions. [2024-11-12 13:07:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 13:07:44,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:44,287 INFO L218 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-12 13:07:44,301 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-12 13:07:44,487 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-12 13:07:44,488 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:44,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 30344724, now seen corresponding path program 1 times [2024-11-12 13:07:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77678139] [2024-11-12 13:07:44,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:44,490 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-12 13:07:44,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:44,492 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-12 13:07:44,493 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-12 13:07:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:45,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:07:45,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:45,123 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-12 13:07:45,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:45,291 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-12 13:07:45,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:45,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77678139] [2024-11-12 13:07:45,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77678139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:45,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:45,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 13:07:45,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438353261] [2024-11-12 13:07:45,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:45,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:07:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:45,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:07:45,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:07:45,296 INFO L87 Difference]: Start difference. First operand 362 states and 457 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:07:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:45,581 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2024-11-12 13:07:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:07:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-11-12 13:07:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:45,584 INFO L225 Difference]: With dead ends: 373 [2024-11-12 13:07:45,584 INFO L226 Difference]: Without dead ends: 373 [2024-11-12 13:07:45,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:07:45,586 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 5 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:45,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1202 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:07:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-12 13:07:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2024-11-12 13:07:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 355 states have (on average 1.2732394366197184) internal successors, (452), 363 states have internal predecessors, (452), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:07:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 471 transitions. [2024-11-12 13:07:45,596 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 471 transitions. Word has length 89 [2024-11-12 13:07:45,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:45,597 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 471 transitions. [2024-11-12 13:07:45,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:07:45,597 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 471 transitions. [2024-11-12 13:07:45,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 13:07:45,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:45,600 INFO L218 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-12 13:07:45,612 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-12 13:07:45,800 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-12 13:07:45,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:45,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:45,802 INFO L85 PathProgramCache]: Analyzing trace with hash -545395726, now seen corresponding path program 2 times [2024-11-12 13:07:45,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:45,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388085153] [2024-11-12 13:07:45,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:07:45,803 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-12 13:07:45,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:45,806 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-12 13:07:45,807 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-12 13:07:46,179 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:07:46,179 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:07:46,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:07:46,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:46,206 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:46,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:46,207 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:46,211 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-12 13:07:46,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:07:46,308 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-12 13:07:46,335 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-12 13:07:46,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:46,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388085153] [2024-11-12 13:07:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388085153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:46,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32470816] [2024-11-12 13:07:46,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:46,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:46,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:46,337 INFO L87 Difference]: Start difference. First operand 371 states and 471 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:07:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:46,947 INFO L93 Difference]: Finished difference Result 531 states and 682 transitions. [2024-11-12 13:07:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:07:46,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-12 13:07:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:46,953 INFO L225 Difference]: With dead ends: 531 [2024-11-12 13:07:46,953 INFO L226 Difference]: Without dead ends: 531 [2024-11-12 13:07:46,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 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-12 13:07:46,954 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 207 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:46,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 850 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 13:07:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-12 13:07:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 373. [2024-11-12 13:07:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 357 states have (on average 1.2717086834733893) internal successors, (454), 365 states have internal predecessors, (454), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:07:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 473 transitions. [2024-11-12 13:07:46,968 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 473 transitions. Word has length 93 [2024-11-12 13:07:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:46,969 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 473 transitions. [2024-11-12 13:07:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:07:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 473 transitions. [2024-11-12 13:07:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-12 13:07:46,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:46,971 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 13:07:46,978 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 13:07:47,175 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-12 13:07:47,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1086748715, now seen corresponding path program 1 times [2024-11-12 13:07:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:47,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998488196] [2024-11-12 13:07:47,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:47,177 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-12 13:07:47,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:47,178 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-12 13:07:47,179 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-12 13:07:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:47,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:07:47,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 13:07:47,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:07:48,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:48,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998488196] [2024-11-12 13:07:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998488196] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:48,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 13:07:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162402514] [2024-11-12 13:07:48,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:48,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:07:48,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:48,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:07:48,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:07:48,288 INFO L87 Difference]: Start difference. First operand 373 states and 473 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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-12 13:07:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:49,018 INFO L93 Difference]: Finished difference Result 388 states and 495 transitions. [2024-11-12 13:07:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:07:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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 125 [2024-11-12 13:07:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:49,021 INFO L225 Difference]: With dead ends: 388 [2024-11-12 13:07:49,021 INFO L226 Difference]: Without dead ends: 384 [2024-11-12 13:07:49,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:07:49,022 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 8 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:49,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1806 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:07:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-12 13:07:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2024-11-12 13:07:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 366 states have (on average 1.273224043715847) internal successors, (466), 374 states have internal predecessors, (466), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:07:49,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 485 transitions. [2024-11-12 13:07:49,032 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 485 transitions. Word has length 125 [2024-11-12 13:07:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:49,033 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 485 transitions. [2024-11-12 13:07:49,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 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-12 13:07:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 485 transitions. [2024-11-12 13:07:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 13:07:49,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:49,034 INFO L218 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] [2024-11-12 13:07:49,050 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-12 13:07:49,235 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-12 13:07:49,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:49,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash -192394168, now seen corresponding path program 2 times [2024-11-12 13:07:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:49,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709525324] [2024-11-12 13:07:49,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:07:49,237 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-12 13:07:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:49,241 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-12 13:07:49,242 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-12 13:07:49,599 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:07:49,599 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:07:49,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:07:49,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-12 13:07:49,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:49,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709525324] [2024-11-12 13:07:49,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709525324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:49,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:49,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095380838] [2024-11-12 13:07:49,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:49,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:49,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:49,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:49,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:49,662 INFO L87 Difference]: Start difference. First operand 382 states and 485 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-12 13:07:49,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:49,821 INFO L93 Difference]: Finished difference Result 388 states and 475 transitions. [2024-11-12 13:07:49,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:07:49,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 134 [2024-11-12 13:07:49,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:49,825 INFO L225 Difference]: With dead ends: 388 [2024-11-12 13:07:49,825 INFO L226 Difference]: Without dead ends: 388 [2024-11-12 13:07:49,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-12 13:07:49,826 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 30 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 806 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-12 13:07:49,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 806 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:07:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-12 13:07:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-11-12 13:07:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 372 states have (on average 1.2258064516129032) internal successors, (456), 380 states have internal predecessors, (456), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:07:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 475 transitions. [2024-11-12 13:07:49,837 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 475 transitions. Word has length 134 [2024-11-12 13:07:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:49,838 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 475 transitions. [2024-11-12 13:07:49,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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-12 13:07:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 475 transitions. [2024-11-12 13:07:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-12 13:07:49,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:49,843 INFO L218 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] [2024-11-12 13:07:49,850 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-12 13:07:50,043 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-12 13:07:50,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:50,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:50,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1157535676, now seen corresponding path program 1 times [2024-11-12 13:07:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15404761] [2024-11-12 13:07:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:50,045 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-12 13:07:50,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:50,048 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-12 13:07:50,049 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-12 13:07:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:50,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:07:50,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:50,965 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-12 13:07:50,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:51,982 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-12 13:07:51,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15404761] [2024-11-12 13:07:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15404761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:51,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 13:07:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509676283] [2024-11-12 13:07:51,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:51,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 13:07:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 13:07:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:07:51,985 INFO L87 Difference]: Start difference. First operand 388 states and 475 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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-12 13:07:54,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:54,037 INFO L93 Difference]: Finished difference Result 412 states and 515 transitions. [2024-11-12 13:07:54,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 13:07:54,039 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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 134 [2024-11-12 13:07:54,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:54,042 INFO L225 Difference]: With dead ends: 412 [2024-11-12 13:07:54,043 INFO L226 Difference]: Without dead ends: 408 [2024-11-12 13:07:54,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 13:07:54,044 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 13 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3760 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:54,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3760 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 13:07:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-12 13:07:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 406. [2024-11-12 13:07:54,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 390 states have (on average 1.2307692307692308) internal successors, (480), 398 states have internal predecessors, (480), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:07:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 499 transitions. [2024-11-12 13:07:54,054 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 499 transitions. Word has length 134 [2024-11-12 13:07:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:54,055 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 499 transitions. [2024-11-12 13:07:54,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 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-12 13:07:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 499 transitions. [2024-11-12 13:07:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 13:07:54,056 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:54,056 INFO L218 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] [2024-11-12 13:07:54,074 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 (11)] Forceful destruction successful, exit code 0 [2024-11-12 13:07:54,257 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-12 13:07:54,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:54,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:54,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1866959908, now seen corresponding path program 2 times [2024-11-12 13:07:54,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:54,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982582163] [2024-11-12 13:07:54,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:07:54,259 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-12 13:07:54,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:54,260 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-12 13:07:54,261 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-12 13:07:54,637 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:07:54,637 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:07:54,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:07:54,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:54,680 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-12 13:07:54,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:54,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982582163] [2024-11-12 13:07:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982582163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:54,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:54,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:07:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826192952] [2024-11-12 13:07:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:54,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:07:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:07:54,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:07:54,684 INFO L87 Difference]: Start difference. First operand 406 states and 499 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-12 13:07:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:54,774 INFO L93 Difference]: Finished difference Result 406 states and 493 transitions. [2024-11-12 13:07:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:07:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 152 [2024-11-12 13:07:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:54,776 INFO L225 Difference]: With dead ends: 406 [2024-11-12 13:07:54,777 INFO L226 Difference]: Without dead ends: 406 [2024-11-12 13:07:54,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-12 13:07:54,778 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 0 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:54,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:07:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-12 13:07:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-11-12 13:07:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 390 states have (on average 1.2153846153846153) internal successors, (474), 398 states have internal predecessors, (474), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:07:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 493 transitions. [2024-11-12 13:07:54,790 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 493 transitions. Word has length 152 [2024-11-12 13:07:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:54,792 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 493 transitions. [2024-11-12 13:07:54,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-12 13:07:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 493 transitions. [2024-11-12 13:07:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 13:07:54,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:54,793 INFO L218 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] [2024-11-12 13:07:54,800 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 (12)] Forceful destruction successful, exit code 0 [2024-11-12 13:07:54,997 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-12 13:07:54,998 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:54,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash -845891554, now seen corresponding path program 1 times [2024-11-12 13:07:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:54,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894420510] [2024-11-12 13:07:54,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:54,999 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-12 13:07:54,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:55,000 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-12 13:07:55,001 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-12 13:07:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:55,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 13:07:55,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:56,323 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-12 13:07:56,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:58,299 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-12 13:07:58,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894420510] [2024-11-12 13:07:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894420510] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:58,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:58,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 13:07:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129005170] [2024-11-12 13:07:58,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:58,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 13:07:58,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:58,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 13:07:58,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 13:07:58,303 INFO L87 Difference]: Start difference. First operand 406 states and 493 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-12 13:08:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:08:05,019 INFO L93 Difference]: Finished difference Result 446 states and 565 transitions. [2024-11-12 13:08:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 13:08:05,020 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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 152 [2024-11-12 13:08:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:08:05,022 INFO L225 Difference]: With dead ends: 446 [2024-11-12 13:08:05,022 INFO L226 Difference]: Without dead ends: 442 [2024-11-12 13:08:05,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 13:08:05,025 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 26 mSDsluCounter, 6937 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7228 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-12 13:08:05,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7228 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-12 13:08:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-12 13:08:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2024-11-12 13:08:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 424 states have (on average 1.2264150943396226) internal successors, (520), 432 states have internal predecessors, (520), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:08:05,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 539 transitions. [2024-11-12 13:08:05,035 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 539 transitions. Word has length 152 [2024-11-12 13:08:05,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:08:05,036 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 539 transitions. [2024-11-12 13:08:05,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 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-12 13:08:05,036 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 539 transitions. [2024-11-12 13:08:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 13:08:05,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:08:05,038 INFO L218 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] [2024-11-12 13:08:05,058 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 (13)] Ended with exit code 0 [2024-11-12 13:08:05,238 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-12 13:08:05,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:08:05,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:08:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1940547198, now seen corresponding path program 2 times [2024-11-12 13:08:05,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:08:05,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713906766] [2024-11-12 13:08:05,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:08:05,242 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-12 13:08:05,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:08:05,247 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-12 13:08:05,252 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-12 13:08:06,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:08:06,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:08:06,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:08:06,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:08:07,138 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-12 13:08:07,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:08:09,232 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-12 13:08:09,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:08:09,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713906766] [2024-11-12 13:08:09,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713906766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:08:09,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:08:09,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-12 13:08:09,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766170317] [2024-11-12 13:08:09,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:08:09,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 13:08:09,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:08:09,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 13:08:09,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 13:08:09,235 INFO L87 Difference]: Start difference. First operand 440 states and 539 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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) [2024-11-12 13:08:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:08:16,483 INFO L93 Difference]: Finished difference Result 469 states and 593 transitions. [2024-11-12 13:08:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-12 13:08:16,484 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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) Word has length 186 [2024-11-12 13:08:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:08:16,486 INFO L225 Difference]: With dead ends: 469 [2024-11-12 13:08:16,486 INFO L226 Difference]: Without dead ends: 469 [2024-11-12 13:08:16,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-12 13:08:16,489 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 26 mSDsluCounter, 7776 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8066 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:08:16,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8066 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-12 13:08:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-12 13:08:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 465. [2024-11-12 13:08:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 449 states have (on average 1.269487750556793) internal successors, (570), 457 states have internal predecessors, (570), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 13:08:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 589 transitions. [2024-11-12 13:08:16,503 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 589 transitions. Word has length 186 [2024-11-12 13:08:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:08:16,504 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 589 transitions. [2024-11-12 13:08:16,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 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) [2024-11-12 13:08:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 589 transitions. [2024-11-12 13:08:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-12 13:08:16,506 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:08:16,506 INFO L218 NwaCegarLoop]: trace histogram [92, 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] [2024-11-12 13:08:16,536 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 (14)] Ended with exit code 0 [2024-11-12 13:08:16,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-12 13:08:16,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:08:16,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:08:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1125503829, now seen corresponding path program 3 times [2024-11-12 13:08:16,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:08:16,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448637336] [2024-11-12 13:08:16,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 13:08:16,712 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-12 13:08:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:08:16,714 INFO L229 MonitoredProcess]: Starting monitored process 15 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-12 13:08:16,715 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 (15)] Waiting until timeout for monitored process [2024-11-12 13:08:17,342 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 13:08:17,342 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:08:17,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:08:17,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:08:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-12 13:08:17,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:08:17,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:08:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448637336] [2024-11-12 13:08:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448637336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:08:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:08:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:08:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60501643] [2024-11-12 13:08:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:08:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:08:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:08:17,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:08:17,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:08:17,777 INFO L87 Difference]: Start difference. First operand 465 states and 589 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-12 13:08:22,142 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-12 13:08:26,151 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-12 13:08:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:08:28,233 INFO L93 Difference]: Finished difference Result 656 states and 838 transitions. [2024-11-12 13:08:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:08:28,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 211 [2024-11-12 13:08:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:08:28,236 INFO L225 Difference]: With dead ends: 656 [2024-11-12 13:08:28,237 INFO L226 Difference]: Without dead ends: 656 [2024-11-12 13:08:28,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 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-12 13:08:28,237 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 559 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:08:28,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 663 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2024-11-12 13:08:28,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-11-12 13:08:28,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 571. [2024-11-12 13:08:28,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 550 states have (on average 1.26) internal successors, (693), 563 states have internal predecessors, (693), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 13:08:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 722 transitions. [2024-11-12 13:08:28,250 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 722 transitions. Word has length 211 [2024-11-12 13:08:28,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:08:28,251 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 722 transitions. [2024-11-12 13:08:28,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-12 13:08:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 722 transitions. [2024-11-12 13:08:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 13:08:28,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:08:28,253 INFO L218 NwaCegarLoop]: trace histogram [92, 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] [2024-11-12 13:08:28,283 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 (15)] Forceful destruction successful, exit code 0 [2024-11-12 13:08:28,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-12 13:08:28,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:08:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:08:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash -692491915, now seen corresponding path program 1 times [2024-11-12 13:08:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:08:28,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916386589] [2024-11-12 13:08:28,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:08:28,457 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-12 13:08:28,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:08:28,460 INFO L229 MonitoredProcess]: Starting monitored process 16 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-12 13:08:28,461 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 (16)] Waiting until timeout for monitored process [2024-11-12 13:08:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:08:30,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 13:08:30,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:08:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 13:08:34,409 INFO L312 TraceCheckSpWp]: Computing backward predicates...