./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:01:06,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:01:06,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:01:06,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:01:06,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:01:06,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:01:06,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:01:06,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:01:06,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:01:06,873 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:01:06,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:01:06,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:01:06,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:01:06,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:01:06,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:01:06,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:01:06,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:01:06,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:01:06,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:01:06,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:01:06,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:01:06,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:01:06,883 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:01:06,883 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:01:06,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:01:06,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:01:06,884 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:01:06,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:01:06,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:01:06,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:01:06,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:01:06,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:01:06,885 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:01:06,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:01:06,885 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:01:06,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:01:06,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:01:06,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:01:06,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:01:06,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:01:06,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:01:06,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:01:06,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:01:06,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:01:06,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:01:06,888 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2024-11-17 00:01:07,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:01:07,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:01:07,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:01:07,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:01:07,205 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:01:07,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-17 00:01:08,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:01:09,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:01:09,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-17 00:01:09,098 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e553106b6/e251ef618f644da58e362463ddb3cc8c/FLAGab7588c60 [2024-11-17 00:01:09,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e553106b6/e251ef618f644da58e362463ddb3cc8c [2024-11-17 00:01:09,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:01:09,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:01:09,118 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:01:09,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:01:09,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:01:09,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:01:09" (1/1) ... [2024-11-17 00:01:09,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ccc053a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:09, skipping insertion in model container [2024-11-17 00:01:09,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:01:09" (1/1) ... [2024-11-17 00:01:09,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:01:09,786 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,823 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,826 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,829 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,836 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,881 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,885 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,887 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,891 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,894 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,898 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,899 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,900 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,904 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:09,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:01:09,932 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 00:01:09,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79e14cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:09, skipping insertion in model container [2024-11-17 00:01:09,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:01:09,933 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:01:09,935 INFO L158 Benchmark]: Toolchain (without parser) took 817.58ms. Allocated memory is still 153.1MB. Free memory was 82.6MB in the beginning and 103.9MB in the end (delta: -21.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-17 00:01:09,935 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 113.2MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:01:09,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 815.35ms. Allocated memory is still 153.1MB. Free memory was 82.3MB in the beginning and 103.9MB in the end (delta: -21.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-17 00:01:09,938 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 113.2MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 815.35ms. Allocated memory is still 153.1MB. Free memory was 82.3MB in the beginning and 103.9MB in the end (delta: -21.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.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 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:01:11,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:01:12,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:01:12,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:01:12,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:01:12,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:01:12,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:01:12,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:01:12,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:01:12,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:01:12,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:01:12,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:01:12,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:01:12,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:01:12,045 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:01:12,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:01:12,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:01:12,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:01:12,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:01:12,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:01:12,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:01:12,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:01:12,050 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:01:12,050 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:01:12,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:01:12,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:01:12,051 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:01:12,054 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:01:12,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:01:12,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:01:12,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:01:12,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:01:12,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:01:12,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:01:12,055 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:01:12,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:01:12,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:01:12,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:01:12,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:01:12,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:01:12,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:01:12,057 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:01:12,058 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:01:12,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:01:12,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:01:12,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:01:12,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:01:12,060 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2024-11-17 00:01:12,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:01:12,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:01:12,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:01:12,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:01:12,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:01:12,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-17 00:01:13,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:01:14,355 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:01:14,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-11-17 00:01:14,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbc5c523f/da391be3320c488c85505872aea355e0/FLAGda4dc7e82 [2024-11-17 00:01:14,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbc5c523f/da391be3320c488c85505872aea355e0 [2024-11-17 00:01:14,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:01:14,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:01:14,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:01:14,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:01:14,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:01:14,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:01:14" (1/1) ... [2024-11-17 00:01:14,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a76d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:14, skipping insertion in model container [2024-11-17 00:01:14,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:01:14" (1/1) ... [2024-11-17 00:01:14,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:01:15,024 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,056 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,059 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,063 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,069 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,097 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,097 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,100 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,100 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,107 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,108 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,109 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,110 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,118 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:01:15,150 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:01:15,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:01:15,196 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,212 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,214 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,216 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,220 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,253 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,253 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,255 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,257 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,259 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,260 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,261 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,261 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,264 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:01:15,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:01:15,271 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:01:15,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:01:15,453 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:01:15,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15 WrapperNode [2024-11-17 00:01:15,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:01:15,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:01:15,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:01:15,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:01:15,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,576 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1036 [2024-11-17 00:01:15,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:01:15,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:01:15,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:01:15,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:01:15,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,694 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 34, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 4, 49]. [2024-11-17 00:01:15,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:01:15,796 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:01:15,796 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:01:15,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:01:15,797 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (1/1) ... [2024-11-17 00:01:15,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:01:15,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:01:15,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:01:15,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:01:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:01:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:01:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:01:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:01:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:01:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-17 00:01:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:01:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:01:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-17 00:01:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-17 00:01:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-17 00:01:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-17 00:01:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:01:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:01:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:01:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:01:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-17 00:01:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-17 00:01:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:01:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:01:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:01:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-17 00:01:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-17 00:01:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-17 00:01:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:01:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:01:16,157 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:01:16,160 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:01:16,255 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2024-11-17 00:01:20,401 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2024-11-17 00:01:20,402 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2024-11-17 00:01:20,402 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:01:20,484 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-17 00:01:20,484 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:01:20,507 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:01:20,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:01:20,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:01:20 BoogieIcfgContainer [2024-11-17 00:01:20,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:01:20,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:01:20,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:01:20,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:01:20,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:01:14" (1/3) ... [2024-11-17 00:01:20,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355d011a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:01:20, skipping insertion in model container [2024-11-17 00:01:20,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:01:15" (2/3) ... [2024-11-17 00:01:20,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355d011a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:01:20, skipping insertion in model container [2024-11-17 00:01:20,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:01:20" (3/3) ... [2024-11-17 00:01:20,519 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2024-11-17 00:01:20,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:01:20,536 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:01:20,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:01:20,598 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;@606b2388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:01:20,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:01:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 216 states have (on average 1.5925925925925926) internal successors, (344), 222 states have internal predecessors, (344), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 00:01:20,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:01:20,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:20,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:20,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:20,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:20,620 INFO L85 PathProgramCache]: Analyzing trace with hash -69365085, now seen corresponding path program 1 times [2024-11-17 00:01:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996814725] [2024-11-17 00:01:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:20,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:20,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:20,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:20,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:01:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:20,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:01:20,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:20,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:20,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:20,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996814725] [2024-11-17 00:01:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996814725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:20,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:20,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:01:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691334751] [2024-11-17 00:01:20,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:20,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:01:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:01:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:01:20,968 INFO L87 Difference]: Start difference. First operand has 242 states, 216 states have (on average 1.5925925925925926) internal successors, (344), 222 states have internal predecessors, (344), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:20,995 INFO L93 Difference]: Finished difference Result 237 states and 302 transitions. [2024-11-17 00:01:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:01:20,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:01:20,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:21,005 INFO L225 Difference]: With dead ends: 237 [2024-11-17 00:01:21,006 INFO L226 Difference]: Without dead ends: 234 [2024-11-17 00:01:21,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:01:21,010 INFO L432 NwaCegarLoop]: 302 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, 302 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:21,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:01:21,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-17 00:01:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2024-11-17 00:01:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 216 states have internal predecessors, (269), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 00:01:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 299 transitions. [2024-11-17 00:01:21,060 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 299 transitions. Word has length 11 [2024-11-17 00:01:21,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:21,060 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 299 transitions. [2024-11-17 00:01:21,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 299 transitions. [2024-11-17 00:01:21,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:01:21,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:21,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:21,068 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 (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:21,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:21,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:21,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:21,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1614935735, now seen corresponding path program 1 times [2024-11-17 00:01:21,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:21,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369178670] [2024-11-17 00:01:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:21,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:21,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:21,269 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:21,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:01:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:21,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:01:21,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:21,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:21,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:21,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369178670] [2024-11-17 00:01:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369178670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:21,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:21,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561877108] [2024-11-17 00:01:21,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:21,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:21,589 INFO L87 Difference]: Start difference. First operand 234 states and 299 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:24,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:01:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:26,036 INFO L93 Difference]: Finished difference Result 353 states and 454 transitions. [2024-11-17 00:01:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:01:26,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2024-11-17 00:01:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:26,041 INFO L225 Difference]: With dead ends: 353 [2024-11-17 00:01:26,041 INFO L226 Difference]: Without dead ends: 353 [2024-11-17 00:01:26,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:26,043 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 141 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:26,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 812 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-17 00:01:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-17 00:01:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 349. [2024-11-17 00:01:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 326 states have (on average 1.2852760736196318) internal successors, (419), 331 states have internal predecessors, (419), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 00:01:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 449 transitions. [2024-11-17 00:01:26,074 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 449 transitions. Word has length 13 [2024-11-17 00:01:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:26,075 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 449 transitions. [2024-11-17 00:01:26,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 449 transitions. [2024-11-17 00:01:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:01:26,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:26,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:26,084 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 (3)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:26,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:26,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:26,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1087250645, now seen corresponding path program 1 times [2024-11-17 00:01:26,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:26,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337944241] [2024-11-17 00:01:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:26,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:26,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:26,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:26,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:01:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:26,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:01:26,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:26,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:01:26,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:01:26,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:01:26,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:01:26,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:01:26,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:01:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:26,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:26,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:26,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337944241] [2024-11-17 00:01:26,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337944241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:26,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:26,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:26,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899968661] [2024-11-17 00:01:26,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:26,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:26,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:26,640 INFO L87 Difference]: Start difference. First operand 349 states and 449 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-17 00:01:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:27,102 INFO L93 Difference]: Finished difference Result 534 states and 694 transitions. [2024-11-17 00:01:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:01:27,103 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-17 00:01:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:27,106 INFO L225 Difference]: With dead ends: 534 [2024-11-17 00:01:27,106 INFO L226 Difference]: Without dead ends: 534 [2024-11-17 00:01:27,106 INFO L431 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-17 00:01:27,108 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 236 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:27,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 893 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:01:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-17 00:01:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 348. [2024-11-17 00:01:27,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 325 states have (on average 1.283076923076923) internal successors, (417), 330 states have internal predecessors, (417), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 00:01:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 447 transitions. [2024-11-17 00:01:27,131 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 447 transitions. Word has length 16 [2024-11-17 00:01:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:27,131 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 447 transitions. [2024-11-17 00:01:27,132 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-17 00:01:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 447 transitions. [2024-11-17 00:01:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:01:27,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:27,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:27,138 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-17 00:01:27,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:27,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:27,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash 470233329, now seen corresponding path program 1 times [2024-11-17 00:01:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:27,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855185218] [2024-11-17 00:01:27,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:27,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:27,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:01:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:27,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:01:27,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:27,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:27,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:27,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855185218] [2024-11-17 00:01:27,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855185218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:27,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:27,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:27,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908194205] [2024-11-17 00:01:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:27,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:27,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:27,643 INFO L87 Difference]: Start difference. First operand 348 states and 447 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:27,747 INFO L93 Difference]: Finished difference Result 354 states and 437 transitions. [2024-11-17 00:01:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:01:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 00:01:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:27,750 INFO L225 Difference]: With dead ends: 354 [2024-11-17 00:01:27,750 INFO L226 Difference]: Without dead ends: 354 [2024-11-17 00:01:27,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:01:27,751 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 30 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:27,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 787 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-17 00:01:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-11-17 00:01:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 331 states have (on average 1.229607250755287) internal successors, (407), 336 states have internal predecessors, (407), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-17 00:01:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 437 transitions. [2024-11-17 00:01:27,763 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 437 transitions. Word has length 52 [2024-11-17 00:01:27,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:27,763 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 437 transitions. [2024-11-17 00:01:27,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:27,764 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 437 transitions. [2024-11-17 00:01:27,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 00:01:27,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:27,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:27,774 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 (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:27,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:27,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:27,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash -300845769, now seen corresponding path program 1 times [2024-11-17 00:01:27,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:27,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002215563] [2024-11-17 00:01:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:27,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:27,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:27,969 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:27,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:01:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:28,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:01:28,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:28,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:28,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:28,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002215563] [2024-11-17 00:01:28,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002215563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:28,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:01:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628235119] [2024-11-17 00:01:28,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:28,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:01:28,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:01:28,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:01:28,323 INFO L87 Difference]: Start difference. First operand 354 states and 437 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:28,425 INFO L93 Difference]: Finished difference Result 364 states and 447 transitions. [2024-11-17 00:01:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:01:28,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 00:01:28,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:28,428 INFO L225 Difference]: With dead ends: 364 [2024-11-17 00:01:28,428 INFO L226 Difference]: Without dead ends: 364 [2024-11-17 00:01:28,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:01:28,429 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 9 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:28,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1406 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:28,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-17 00:01:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-17 00:01:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 338 states have (on average 1.227810650887574) internal successors, (415), 344 states have internal predecessors, (415), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-17 00:01:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 447 transitions. [2024-11-17 00:01:28,439 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 447 transitions. Word has length 52 [2024-11-17 00:01:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:28,440 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 447 transitions. [2024-11-17 00:01:28,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:01:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 447 transitions. [2024-11-17 00:01:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 00:01:28,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:28,442 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:28,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 00:01:28,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:28,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:28,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2032359365, now seen corresponding path program 1 times [2024-11-17 00:01:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:28,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860607055] [2024-11-17 00:01:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:28,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:28,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:28,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-17 00:01:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:28,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:01:29,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:29,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:29,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:29,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860607055] [2024-11-17 00:01:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860607055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:29,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:29,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:01:29,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369351643] [2024-11-17 00:01:29,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:29,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:01:29,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:01:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:01:29,186 INFO L87 Difference]: Start difference. First operand 364 states and 447 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:01:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:29,393 INFO L93 Difference]: Finished difference Result 373 states and 458 transitions. [2024-11-17 00:01:29,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:01:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 67 [2024-11-17 00:01:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:29,396 INFO L225 Difference]: With dead ends: 373 [2024-11-17 00:01:29,397 INFO L226 Difference]: Without dead ends: 373 [2024-11-17 00:01:29,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:01:29,399 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 20 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:29,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1261 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:01:29,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-17 00:01:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 369. [2024-11-17 00:01:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 341 states have (on average 1.2258064516129032) internal successors, (418), 348 states have internal predecessors, (418), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2024-11-17 00:01:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 453 transitions. [2024-11-17 00:01:29,413 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 453 transitions. Word has length 67 [2024-11-17 00:01:29,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:29,414 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 453 transitions. [2024-11-17 00:01:29,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:01:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 453 transitions. [2024-11-17 00:01:29,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 00:01:29,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:29,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:29,426 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 (7)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:29,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:29,617 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:29,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:29,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1522747576, now seen corresponding path program 1 times [2024-11-17 00:01:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121276959] [2024-11-17 00:01:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:29,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:29,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:29,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:29,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:01:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:29,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:01:29,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:30,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:30,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:30,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121276959] [2024-11-17 00:01:30,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121276959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:30,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:30,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974673879] [2024-11-17 00:01:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:30,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:30,033 INFO L87 Difference]: Start difference. First operand 369 states and 453 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:01:30,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:30,066 INFO L93 Difference]: Finished difference Result 373 states and 458 transitions. [2024-11-17 00:01:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:01:30,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2024-11-17 00:01:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:30,069 INFO L225 Difference]: With dead ends: 373 [2024-11-17 00:01:30,069 INFO L226 Difference]: Without dead ends: 373 [2024-11-17 00:01:30,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:30,070 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:30,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 847 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:01:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-17 00:01:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-11-17 00:01:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 344 states have (on average 1.2267441860465116) internal successors, (422), 352 states have internal predecessors, (422), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-17 00:01:30,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 458 transitions. [2024-11-17 00:01:30,083 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 458 transitions. Word has length 72 [2024-11-17 00:01:30,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:30,084 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 458 transitions. [2024-11-17 00:01:30,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:01:30,085 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 458 transitions. [2024-11-17 00:01:30,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 00:01:30,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:30,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:30,097 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-17 00:01:30,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:30,287 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:30,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1186685271, now seen corresponding path program 1 times [2024-11-17 00:01:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:30,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599171417] [2024-11-17 00:01:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:30,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:30,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:30,289 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:30,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:01:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:30,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:01:30,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:30,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:01:30,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599171417] [2024-11-17 00:01:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599171417] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:30,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:01:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424561298] [2024-11-17 00:01:30,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:30,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:01:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:30,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:01:30,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:01:30,886 INFO L87 Difference]: Start difference. First operand 373 states and 458 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 00:01:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:31,049 INFO L93 Difference]: Finished difference Result 386 states and 476 transitions. [2024-11-17 00:01:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:01:31,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 73 [2024-11-17 00:01:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:31,052 INFO L225 Difference]: With dead ends: 386 [2024-11-17 00:01:31,052 INFO L226 Difference]: Without dead ends: 386 [2024-11-17 00:01:31,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:01:31,053 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 4 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:31,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1684 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:01:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-17 00:01:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2024-11-17 00:01:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 353 states have (on average 1.2379603399433428) internal successors, (437), 361 states have internal predecessors, (437), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-11-17 00:01:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 473 transitions. [2024-11-17 00:01:31,063 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 473 transitions. Word has length 73 [2024-11-17 00:01:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:31,064 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 473 transitions. [2024-11-17 00:01:31,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 00:01:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 473 transitions. [2024-11-17 00:01:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-17 00:01:31,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:31,065 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-17 00:01:31,075 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 (9)] Forceful destruction successful, exit code 0 [2024-11-17 00:01:31,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:31,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:31,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1538000776, now seen corresponding path program 2 times [2024-11-17 00:01:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:31,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535708664] [2024-11-17 00:01:31,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:01:31,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:31,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:31,270 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:31,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:01:31,838 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:01:31,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:31,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:01:31,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:01:32,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:01:32,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535708664] [2024-11-17 00:01:32,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535708664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:32,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:32,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-17 00:01:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766670089] [2024-11-17 00:01:32,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:32,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 00:01:32,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:32,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 00:01:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:01:32,302 INFO L87 Difference]: Start difference. First operand 383 states and 473 transitions. Second operand has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 10 states have internal predecessors, (121), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:01:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:33,804 INFO L93 Difference]: Finished difference Result 2809 states and 3533 transitions. [2024-11-17 00:01:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-17 00:01:33,805 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 10 states have internal predecessors, (121), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 76 [2024-11-17 00:01:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:33,819 INFO L225 Difference]: With dead ends: 2809 [2024-11-17 00:01:33,820 INFO L226 Difference]: Without dead ends: 2809 [2024-11-17 00:01:33,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-11-17 00:01:33,821 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 2749 mSDsluCounter, 4830 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 5607 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:33,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 5607 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-17 00:01:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2024-11-17 00:01:33,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 1929. [2024-11-17 00:01:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1835 states have (on average 1.2517711171662125) internal successors, (2297), 1849 states have internal predecessors, (2297), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-17 00:01:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2417 transitions. [2024-11-17 00:01:33,878 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2417 transitions. Word has length 76 [2024-11-17 00:01:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:33,879 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2417 transitions. [2024-11-17 00:01:33,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 10 states have internal predecessors, (121), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 00:01:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2417 transitions. [2024-11-17 00:01:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-17 00:01:33,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:33,884 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:33,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:01:34,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:34,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:34,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash 377485192, now seen corresponding path program 1 times [2024-11-17 00:01:34,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:34,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732139542] [2024-11-17 00:01:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:34,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:34,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:34,087 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:34,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:01:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:34,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:01:34,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-17 00:01:34,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-17 00:01:35,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:35,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732139542] [2024-11-17 00:01:35,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732139542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:35,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:35,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:01:35,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361925596] [2024-11-17 00:01:35,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:35,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:01:35,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:35,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:01:35,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:01:35,020 INFO L87 Difference]: Start difference. First operand 1929 states and 2417 transitions. Second operand has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-17 00:01:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:35,574 INFO L93 Difference]: Finished difference Result 2019 states and 2542 transitions. [2024-11-17 00:01:35,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:01:35,575 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2024-11-17 00:01:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:35,583 INFO L225 Difference]: With dead ends: 2019 [2024-11-17 00:01:35,584 INFO L226 Difference]: Without dead ends: 1989 [2024-11-17 00:01:35,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:01:35,585 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 7 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:35,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1965 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:01:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2024-11-17 00:01:35,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1974. [2024-11-17 00:01:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1880 states have (on average 1.2537234042553191) internal successors, (2357), 1894 states have internal predecessors, (2357), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-17 00:01:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2477 transitions. [2024-11-17 00:01:35,629 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2477 transitions. Word has length 113 [2024-11-17 00:01:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:35,629 INFO L471 AbstractCegarLoop]: Abstraction has 1974 states and 2477 transitions. [2024-11-17 00:01:35,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-17 00:01:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2477 transitions. [2024-11-17 00:01:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-17 00:01:35,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:35,632 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:01:35,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:01:35,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:35,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:35,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash 231923045, now seen corresponding path program 2 times [2024-11-17 00:01:35,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:35,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142393169] [2024-11-17 00:01:35,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:01:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:35,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:35,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:01:36,164 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:01:36,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:36,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:01:36,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:36,180 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:01:36,181 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:01:36,182 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:01:36,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:01:36,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:01:36,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:01:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-17 00:01:36,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:01:36,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142393169] [2024-11-17 00:01:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142393169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:01:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:01:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:01:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397428148] [2024-11-17 00:01:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:01:36,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:01:36,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:36,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:01:36,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:01:36,239 INFO L87 Difference]: Start difference. First operand 1974 states and 2477 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 00:01:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:36,666 INFO L93 Difference]: Finished difference Result 2758 states and 3511 transitions. [2024-11-17 00:01:36,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:01:36,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 122 [2024-11-17 00:01:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:36,676 INFO L225 Difference]: With dead ends: 2758 [2024-11-17 00:01:36,677 INFO L226 Difference]: Without dead ends: 2758 [2024-11-17 00:01:36,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:01:36,677 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 220 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:36,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 790 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-17 00:01:36,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2024-11-17 00:01:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 1986. [2024-11-17 00:01:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1892 states have (on average 1.2521141649048626) internal successors, (2369), 1906 states have internal predecessors, (2369), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-17 00:01:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2489 transitions. [2024-11-17 00:01:36,742 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2489 transitions. Word has length 122 [2024-11-17 00:01:36,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:36,743 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2489 transitions. [2024-11-17 00:01:36,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-17 00:01:36,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2489 transitions. [2024-11-17 00:01:36,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-17 00:01:36,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:36,745 INFO L215 NwaCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:01:36,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 00:01:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:36,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:36,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:36,946 INFO L85 PathProgramCache]: Analyzing trace with hash 162388490, now seen corresponding path program 1 times [2024-11-17 00:01:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824468390] [2024-11-17 00:01:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:01:36,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:36,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:36,948 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:36,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:01:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:01:37,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 00:01:37,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 95 proven. 55 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 00:01:37,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-17 00:01:38,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:38,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824468390] [2024-11-17 00:01:38,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824468390] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:38,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:38,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:01:38,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870431704] [2024-11-17 00:01:38,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:38,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:01:38,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:38,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:01:38,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:01:38,561 INFO L87 Difference]: Start difference. First operand 1986 states and 2489 transitions. Second operand has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:01:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:40,871 INFO L93 Difference]: Finished difference Result 2121 states and 2704 transitions. [2024-11-17 00:01:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:01:40,872 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2024-11-17 00:01:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:40,878 INFO L225 Difference]: With dead ends: 2121 [2024-11-17 00:01:40,879 INFO L226 Difference]: Without dead ends: 2091 [2024-11-17 00:01:40,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:01:40,880 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 13 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:40,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3367 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:01:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2024-11-17 00:01:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2076. [2024-11-17 00:01:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1982 states have (on average 1.2558022199798184) internal successors, (2489), 1996 states have internal predecessors, (2489), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-17 00:01:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2609 transitions. [2024-11-17 00:01:40,936 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2609 transitions. Word has length 128 [2024-11-17 00:01:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:40,936 INFO L471 AbstractCegarLoop]: Abstraction has 2076 states and 2609 transitions. [2024-11-17 00:01:40,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.615384615384615) internal successors, (120), 26 states have internal predecessors, (120), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:01:40,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2609 transitions. [2024-11-17 00:01:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-17 00:01:40,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:40,938 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:01:40,957 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-17 00:01:41,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:41,140 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:41,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:41,141 INFO L85 PathProgramCache]: Analyzing trace with hash 284613610, now seen corresponding path program 2 times [2024-11-17 00:01:41,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:41,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221726914] [2024-11-17 00:01:41,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:01:41,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:41,145 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:01:41,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:01:42,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:01:42,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:42,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 00:01:42,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 317 proven. 253 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-17 00:01:42,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:01:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-17 00:01:44,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:01:44,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221726914] [2024-11-17 00:01:44,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221726914] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:01:44,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:01:44,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:01:44,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976103396] [2024-11-17 00:01:44,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:01:44,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:01:44,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:01:44,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:01:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:01:44,825 INFO L87 Difference]: Start difference. First operand 2076 states and 2609 transitions. Second operand has 50 states, 50 states have (on average 2.88) internal successors, (144), 50 states have internal predecessors, (144), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:01:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:01:57,211 INFO L93 Difference]: Finished difference Result 2291 states and 2984 transitions. [2024-11-17 00:01:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:01:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.88) internal successors, (144), 50 states have internal predecessors, (144), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 146 [2024-11-17 00:01:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:01:57,219 INFO L225 Difference]: With dead ends: 2291 [2024-11-17 00:01:57,219 INFO L226 Difference]: Without dead ends: 2261 [2024-11-17 00:01:57,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:01:57,223 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 26 mSDsluCounter, 6443 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6727 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-17 00:01:57,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6727 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-17 00:01:57,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2024-11-17 00:01:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2246. [2024-11-17 00:01:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2246 states, 2152 states have (on average 1.2634758364312269) internal successors, (2719), 2166 states have internal predecessors, (2719), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-11-17 00:01:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2839 transitions. [2024-11-17 00:01:57,264 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2839 transitions. Word has length 146 [2024-11-17 00:01:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:01:57,265 INFO L471 AbstractCegarLoop]: Abstraction has 2246 states and 2839 transitions. [2024-11-17 00:01:57,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.88) internal successors, (144), 50 states have internal predecessors, (144), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-17 00:01:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2839 transitions. [2024-11-17 00:01:57,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-17 00:01:57,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:01:57,282 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:01:57,308 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-17 00:01:57,483 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-17 00:01:57,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:01:57,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:01:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -317858934, now seen corresponding path program 3 times [2024-11-17 00:01:57,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:01:57,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125381637] [2024-11-17 00:01:57,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:01:57,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:01:57,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:01:57,486 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-17 00:01:57,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 (15)] Waiting until timeout for monitored process [2024-11-17 00:01:58,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:01:58,725 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:01:58,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-17 00:01:58,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:01:58,793 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 44 treesize of output 53 [2024-11-17 00:01:59,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 334 [2024-11-17 00:01:59,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 214 [2024-11-17 00:01:59,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:01:59,096 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 214 treesize of output 94 [2024-11-17 00:02:00,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-11-17 00:02:00,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-11-17 00:02:00,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:02:00,746 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 68 treesize of output 20 [2024-11-17 00:02:01,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:02:01,281 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 214 treesize of output 106 [2024-11-17 00:02:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2442 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 2357 trivial. 0 not checked. [2024-11-17 00:02:01,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:02:01,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125381637] [2024-11-17 00:02:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125381637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:02:01,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:02:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-17 00:02:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910836303] [2024-11-17 00:02:01,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:02:01,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:02:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:02:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:02:01,519 INFO L87 Difference]: Start difference. First operand 2246 states and 2839 transitions. Second operand has 16 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-17 00:02:05,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-17 00:02:08,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:02:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:19,146 INFO L93 Difference]: Finished difference Result 2853 states and 3614 transitions. [2024-11-17 00:02:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-17 00:02:19,148 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 180 [2024-11-17 00:02:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:19,159 INFO L225 Difference]: With dead ends: 2853 [2024-11-17 00:02:19,159 INFO L226 Difference]: Without dead ends: 2838 [2024-11-17 00:02:19,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-11-17 00:02:19,161 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 301 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:19,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 3577 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2024-11-17 00:02:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2024-11-17 00:02:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2513. [2024-11-17 00:02:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2410 states have (on average 1.2535269709543568) internal successors, (3021), 2425 states have internal predecessors, (3021), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-17 00:02:19,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3154 transitions. [2024-11-17 00:02:19,218 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3154 transitions. Word has length 180 [2024-11-17 00:02:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:19,218 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 3154 transitions. [2024-11-17 00:02:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-17 00:02:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3154 transitions. [2024-11-17 00:02:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-17 00:02:19,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:19,221 INFO L215 NwaCegarLoop]: trace histogram [68, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:02:19,243 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 (15)] Ended with exit code 0 [2024-11-17 00:02:19,421 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-17 00:02:19,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:19,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:19,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1645791149, now seen corresponding path program 4 times [2024-11-17 00:02:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:19,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565222660] [2024-11-17 00:02:19,423 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 00:02:19,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:19,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:19,424 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-17 00:02:19,425 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-17 00:02:21,335 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 00:02:21,335 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:02:21,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 1476 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:02:21,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-17 00:02:21,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:02:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 144 proven. 1 refuted. 0 times theorem prover too weak. 2367 trivial. 0 not checked. [2024-11-17 00:02:21,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:21,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565222660] [2024-11-17 00:02:21,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565222660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:02:21,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:02:21,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:02:21,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254862923] [2024-11-17 00:02:21,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:02:21,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:02:21,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:21,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:02:21,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:02:21,726 INFO L87 Difference]: Start difference. First operand 2513 states and 3154 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-17 00:02:21,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:02:21,960 INFO L93 Difference]: Finished difference Result 2543 states and 3174 transitions. [2024-11-17 00:02:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:02:21,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 181 [2024-11-17 00:02:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:02:21,970 INFO L225 Difference]: With dead ends: 2543 [2024-11-17 00:02:21,970 INFO L226 Difference]: Without dead ends: 2513 [2024-11-17 00:02:21,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:02:21,973 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 4 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:02:21,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1135 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:02:21,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2024-11-17 00:02:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2513. [2024-11-17 00:02:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2410 states have (on average 1.2473029045643154) internal successors, (3006), 2425 states have internal predecessors, (3006), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-11-17 00:02:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3139 transitions. [2024-11-17 00:02:22,025 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3139 transitions. Word has length 181 [2024-11-17 00:02:22,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:02:22,026 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 3139 transitions. [2024-11-17 00:02:22,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-17 00:02:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3139 transitions. [2024-11-17 00:02:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-17 00:02:22,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:02:22,028 INFO L215 NwaCegarLoop]: trace histogram [71, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-17 00:02:22,056 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 (16)] Ended with exit code 0 [2024-11-17 00:02:22,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:22,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:02:22,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:02:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1316572234, now seen corresponding path program 5 times [2024-11-17 00:02:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:02:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538057487] [2024-11-17 00:02:22,231 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 00:02:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:02:22,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:02:22,235 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:02:22,236 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 (17)] Waiting until timeout for monitored process [2024-11-17 00:02:26,270 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-17 00:02:26,270 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:02:26,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-17 00:02:26,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:02:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1446 proven. 276 refuted. 0 times theorem prover too weak. 1006 trivial. 0 not checked. [2024-11-17 00:02:27,232 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:02:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2728 backedges. 1083 proven. 399 refuted. 0 times theorem prover too weak. 1246 trivial. 0 not checked. [2024-11-17 00:02:29,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:02:29,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538057487] [2024-11-17 00:02:29,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538057487] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:02:29,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:02:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:02:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700561072] [2024-11-17 00:02:29,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:02:29,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:02:29,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:02:29,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:02:29,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:02:29,949 INFO L87 Difference]: Start difference. First operand 2513 states and 3139 transitions. Second operand has 52 states, 52 states have (on average 2.8076923076923075) internal successors, (146), 52 states have internal predecessors, (146), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)