./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:55:19,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:55:19,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 16:55:19,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:55:19,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:55:19,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:55:19,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:55:19,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:55:19,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:55:19,901 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:55:19,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:55:19,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:55:19,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:55:19,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:55:19,905 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:55:19,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:55:19,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:55:19,906 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:55:19,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:55:19,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:55:19,907 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:55:19,907 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:55:19,911 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:55:19,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:55:19,912 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:55:19,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:55:19,912 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:55:19,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:55:19,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:55:19,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:55:19,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:55:19,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:55:19,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:55:19,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:55:19,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:55:19,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:55:19,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 16:55:19,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 16:55:19,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:55:19,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:55:19,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:55:19,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:55:19,919 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-11-20 16:55:20,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:55:20,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:55:20,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:55:20,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:55:20,225 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:55:20,226 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-20 16:55:21,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:55:22,158 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:55:22,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-20 16:55:22,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbf7912f/7180bf24355840a3b7e3f7e0a393b265/FLAGab9718dfb [2024-11-20 16:55:22,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbf7912f/7180bf24355840a3b7e3f7e0a393b265 [2024-11-20 16:55:22,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:55:22,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:55:22,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:55:22,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:55:22,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:55:22,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:55:22" (1/1) ... [2024-11-20 16:55:22,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15297e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:22, skipping insertion in model container [2024-11-20 16:55:22,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:55:22" (1/1) ... [2024-11-20 16:55:22,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:55:23,189 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,213 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,216 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,221 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,252 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,253 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,256 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,256 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,258 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,262 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,263 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,264 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,270 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:23,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:55:23,293 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-20 16:55:23,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7a760d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:23, skipping insertion in model container [2024-11-20 16:55:23,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:55:23,295 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 16:55:23,297 INFO L158 Benchmark]: Toolchain (without parser) took 927.67ms. Allocated memory is still 213.9MB. Free memory was 141.0MB in the beginning and 165.5MB in the end (delta: -24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 16:55:23,297 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 213.9MB. Free memory was 178.1MB in the beginning and 177.9MB in the end (delta: 205.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 16:55:23,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 925.45ms. Allocated memory is still 213.9MB. Free memory was 141.0MB in the beginning and 165.5MB in the end (delta: -24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 16:55:23,300 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.17ms. Allocated memory is still 213.9MB. Free memory was 178.1MB in the beginning and 177.9MB in the end (delta: 205.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 925.45ms. Allocated memory is still 213.9MB. Free memory was 141.0MB in the beginning and 165.5MB in the end (delta: -24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 16:55:25,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 16:55:25,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 16:55:25,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 16:55:25,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 16:55:25,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 16:55:25,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 16:55:25,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 16:55:25,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 16:55:25,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 16:55:25,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 16:55:25,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 16:55:25,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 16:55:25,385 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 16:55:25,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 16:55:25,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 16:55:25,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 16:55:25,386 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 16:55:25,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 16:55:25,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 16:55:25,390 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 16:55:25,391 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 16:55:25,391 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 16:55:25,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 16:55:25,392 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 16:55:25,392 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 16:55:25,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 16:55:25,393 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 16:55:25,393 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 16:55:25,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 16:55:25,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 16:55:25,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 16:55:25,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 16:55:25,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 16:55:25,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 16:55:25,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:55:25,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 16:55:25,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 16:55:25,397 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 16:55:25,397 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 16:55:25,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 16:55:25,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 16:55:25,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 16:55:25,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 16:55:25,398 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-11-20 16:55:25,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 16:55:25,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 16:55:25,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 16:55:25,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 16:55:25,751 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 16:55:25,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-20 16:55:27,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 16:55:27,680 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 16:55:27,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-20 16:55:27,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f1a5f49/730945f120a0474193fbf248d2b3f9d4/FLAG76196af9c [2024-11-20 16:55:27,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4f1a5f49/730945f120a0474193fbf248d2b3f9d4 [2024-11-20 16:55:27,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 16:55:27,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 16:55:27,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 16:55:27,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 16:55:27,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 16:55:27,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:55:27" (1/1) ... [2024-11-20 16:55:27,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b97718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:27, skipping insertion in model container [2024-11-20 16:55:27,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:55:27" (1/1) ... [2024-11-20 16:55:27,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:55:28,490 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,511 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,516 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,521 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,528 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,559 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,559 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,582 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,584 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,587 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,588 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,591 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:55:28,607 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 16:55:28,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 16:55:28,703 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,720 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,726 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,728 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,736 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,761 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,762 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,763 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,764 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,765 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,766 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,767 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,768 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,768 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,770 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 16:55:28,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:55:28,777 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 16:55:28,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 16:55:28,968 INFO L204 MainTranslator]: Completed translation [2024-11-20 16:55:28,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28 WrapperNode [2024-11-20 16:55:28,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 16:55:28,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 16:55:28,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 16:55:28,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 16:55:28,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,139 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3062 [2024-11-20 16:55:29,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 16:55:29,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 16:55:29,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 16:55:29,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 16:55:29,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,283 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-20 16:55:29,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 16:55:29,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 16:55:29,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 16:55:29,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 16:55:29,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (1/1) ... [2024-11-20 16:55:29,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 16:55:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 16:55:29,460 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-20 16:55:29,462 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-20 16:55:29,495 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 16:55:29,495 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 16:55:29,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 16:55:29,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 16:55:29,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 16:55:29,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 16:55:29,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 16:55:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 16:55:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 16:55:29,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 16:55:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 16:55:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 16:55:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 16:55:29,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 16:55:29,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 16:55:29,496 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 16:55:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 16:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 16:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 16:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 16:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 16:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 16:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 16:55:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 16:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 16:55:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 16:55:29,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 16:55:29,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 16:55:29,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 16:55:29,751 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:55:29,791 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:55:29,865 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 16:55:34,829 INFO L? ?]: Removed 1596 outVars from TransFormulas that were not future-live. [2024-11-20 16:55:34,829 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 16:55:34,888 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 16:55:34,888 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-20 16:55:34,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:55:34 BoogieIcfgContainer [2024-11-20 16:55:34,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 16:55:34,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 16:55:34,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 16:55:34,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 16:55:34,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:55:27" (1/3) ... [2024-11-20 16:55:34,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250736ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:55:34, skipping insertion in model container [2024-11-20 16:55:34,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:55:28" (2/3) ... [2024-11-20 16:55:34,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250736ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:55:34, skipping insertion in model container [2024-11-20 16:55:34,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:55:34" (3/3) ... [2024-11-20 16:55:34,900 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2024-11-20 16:55:34,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 16:55:34,916 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-20 16:55:35,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 16:55:35,014 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;@143a1478, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 16:55:35,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-20 16:55:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-20 16:55:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 16:55:35,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:35,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 16:55:35,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:35,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:35,044 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-20 16:55:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168128149] [2024-11-20 16:55:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:35,057 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-20 16:55:35,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:35,061 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-20 16:55:35,063 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-20 16:55:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:35,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:55:35,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:35,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 16:55:35,275 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-20 16:55:35,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:35,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:35,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168128149] [2024-11-20 16:55:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168128149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:55:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543363407] [2024-11-20 16:55:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:35,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:55:35,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:35,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:55:35,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:35,307 INFO L87 Difference]: Start difference. First operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:37,713 INFO L93 Difference]: Finished difference Result 2238 states and 3305 transitions. [2024-11-20 16:55:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:55:37,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 16:55:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:37,747 INFO L225 Difference]: With dead ends: 2238 [2024-11-20 16:55:37,747 INFO L226 Difference]: Without dead ends: 2236 [2024-11-20 16:55:37,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:37,751 INFO L432 NwaCegarLoop]: 2640 mSDtfsCounter, 1973 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:37,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 2796 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 16:55:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2024-11-20 16:55:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2057. [2024-11-20 16:55:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 1040 states have (on average 2.0259615384615386) internal successors, (2107), 2050 states have internal predecessors, (2107), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-20 16:55:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3115 transitions. [2024-11-20 16:55:38,137 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3115 transitions. Word has length 3 [2024-11-20 16:55:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:38,138 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 3115 transitions. [2024-11-20 16:55:38,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:38,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3115 transitions. [2024-11-20 16:55:38,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-20 16:55:38,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:38,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-20 16:55:38,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 16:55:38,339 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-20 16:55:38,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:38,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-20 16:55:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639270421] [2024-11-20 16:55:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:38,343 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-20 16:55:38,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:38,363 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-20 16:55:38,366 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-20 16:55:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:38,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:55:38,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:38,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-20 16:55:38,535 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-20 16:55:38,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:38,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639270421] [2024-11-20 16:55:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639270421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:38,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:38,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:55:38,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164393137] [2024-11-20 16:55:38,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:38,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:55:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:38,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:55:38,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:38,548 INFO L87 Difference]: Start difference. First operand 2057 states and 3115 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:41,327 INFO L93 Difference]: Finished difference Result 3474 states and 5565 transitions. [2024-11-20 16:55:41,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:55:41,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-20 16:55:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:41,344 INFO L225 Difference]: With dead ends: 3474 [2024-11-20 16:55:41,344 INFO L226 Difference]: Without dead ends: 3474 [2024-11-20 16:55:41,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:41,346 INFO L432 NwaCegarLoop]: 3017 mSDtfsCounter, 1449 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:41,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5104 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 16:55:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2024-11-20 16:55:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3185. [2024-11-20 16:55:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 1669 states have (on average 2.0029958058717794) internal successors, (3343), 3178 states have internal predecessors, (3343), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:55:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 5351 transitions. [2024-11-20 16:55:41,615 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 5351 transitions. Word has length 3 [2024-11-20 16:55:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:41,616 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 5351 transitions. [2024-11-20 16:55:41,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 5351 transitions. [2024-11-20 16:55:41,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 16:55:41,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:41,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:55:41,621 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-20 16:55:41,819 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-20 16:55:41,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:41,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:41,821 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-20 16:55:41,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:41,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081321261] [2024-11-20 16:55:41,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:41,822 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-20 16:55:41,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:41,825 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-20 16:55:41,826 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-20 16:55:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:41,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:55:41,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:41,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-20 16:55:41,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 16:55:42,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:55:42,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 16:55:42,066 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:55:42,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 16:55:42,088 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-20 16:55:42,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:42,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:42,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081321261] [2024-11-20 16:55:42,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081321261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:42,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:42,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:55:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620682693] [2024-11-20 16:55:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:42,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:55:42,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:42,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:55:42,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:55:42,091 INFO L87 Difference]: Start difference. First operand 3185 states and 5351 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:45,428 INFO L93 Difference]: Finished difference Result 3353 states and 5527 transitions. [2024-11-20 16:55:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:55:45,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 16:55:45,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:45,443 INFO L225 Difference]: With dead ends: 3353 [2024-11-20 16:55:45,443 INFO L226 Difference]: Without dead ends: 3353 [2024-11-20 16:55:45,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:55:45,444 INFO L432 NwaCegarLoop]: 2371 mSDtfsCounter, 2257 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:45,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 2471 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-20 16:55:45,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2024-11-20 16:55:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2045. [2024-11-20 16:55:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 1040 states have (on average 2.0134615384615384) internal successors, (2094), 2038 states have internal predecessors, (2094), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-20 16:55:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 3102 transitions. [2024-11-20 16:55:45,713 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 3102 transitions. Word has length 7 [2024-11-20 16:55:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:45,713 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 3102 transitions. [2024-11-20 16:55:45,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 3102 transitions. [2024-11-20 16:55:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 16:55:45,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:45,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:55:45,719 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-20 16:55:45,914 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-20 16:55:45,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:45,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-20 16:55:45,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:45,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554818142] [2024-11-20 16:55:45,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:45,917 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-20 16:55:45,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:45,920 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-20 16:55:45,921 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-20 16:55:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:46,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:55:46,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:46,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-20 16:55:46,071 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-20 16:55:46,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:46,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554818142] [2024-11-20 16:55:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554818142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:46,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:46,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:55:46,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252874884] [2024-11-20 16:55:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:46,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:55:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:46,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:55:46,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:46,073 INFO L87 Difference]: Start difference. First operand 2045 states and 3102 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:48,387 INFO L93 Difference]: Finished difference Result 3338 states and 5424 transitions. [2024-11-20 16:55:48,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:55:48,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 16:55:48,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:48,401 INFO L225 Difference]: With dead ends: 3338 [2024-11-20 16:55:48,402 INFO L226 Difference]: Without dead ends: 3338 [2024-11-20 16:55:48,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:48,403 INFO L432 NwaCegarLoop]: 4987 mSDtfsCounter, 1505 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 7415 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:48,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 7415 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 16:55:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2024-11-20 16:55:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2072. [2024-11-20 16:55:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1077 states have (on average 2.007428040854225) internal successors, (2162), 2065 states have internal predecessors, (2162), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-20 16:55:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3170 transitions. [2024-11-20 16:55:48,613 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3170 transitions. Word has length 8 [2024-11-20 16:55:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:48,613 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3170 transitions. [2024-11-20 16:55:48,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:48,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3170 transitions. [2024-11-20 16:55:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 16:55:48,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:48,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:55:48,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 16:55:48,814 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-20 16:55:48,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:48,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-20 16:55:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928932413] [2024-11-20 16:55:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:48,816 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-20 16:55:48,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:48,819 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-20 16:55:48,820 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-20 16:55:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:48,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:55:48,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:48,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 16:55:48,948 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-20 16:55:48,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:48,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928932413] [2024-11-20 16:55:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928932413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:48,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 16:55:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463535383] [2024-11-20 16:55:48,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:48,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:55:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:55:48,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:48,951 INFO L87 Difference]: Start difference. First operand 2072 states and 3170 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:50,839 INFO L93 Difference]: Finished difference Result 3242 states and 5358 transitions. [2024-11-20 16:55:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:55:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-20 16:55:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:50,854 INFO L225 Difference]: With dead ends: 3242 [2024-11-20 16:55:50,855 INFO L226 Difference]: Without dead ends: 3242 [2024-11-20 16:55:50,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:50,856 INFO L432 NwaCegarLoop]: 4761 mSDtfsCounter, 1754 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 7020 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:50,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 7020 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 16:55:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2024-11-20 16:55:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2025. [2024-11-20 16:55:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1077 states have (on average 1.9600742804085423) internal successors, (2111), 2018 states have internal predecessors, (2111), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-20 16:55:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 3119 transitions. [2024-11-20 16:55:51,090 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 3119 transitions. Word has length 8 [2024-11-20 16:55:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:51,091 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 3119 transitions. [2024-11-20 16:55:51,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:51,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 3119 transitions. [2024-11-20 16:55:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 16:55:51,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:51,092 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:55:51,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 (6)] Forceful destruction successful, exit code 0 [2024-11-20 16:55:51,292 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-20 16:55:51,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:51,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:51,293 INFO L85 PathProgramCache]: Analyzing trace with hash -282866277, now seen corresponding path program 1 times [2024-11-20 16:55:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:51,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060118017] [2024-11-20 16:55:51,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:51,294 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-20 16:55:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:51,296 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-20 16:55:51,297 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-20 16:55:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:51,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:55:51,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:51,475 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-20 16:55:51,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:51,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:51,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060118017] [2024-11-20 16:55:51,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060118017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:51,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:51,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:55:51,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118006155] [2024-11-20 16:55:51,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:51,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:55:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:51,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:55:51,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:51,477 INFO L87 Difference]: Start difference. First operand 2025 states and 3119 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:51,727 INFO L93 Difference]: Finished difference Result 3470 states and 5620 transitions. [2024-11-20 16:55:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:55:51,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 16:55:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:51,741 INFO L225 Difference]: With dead ends: 3470 [2024-11-20 16:55:51,741 INFO L226 Difference]: Without dead ends: 3470 [2024-11-20 16:55:51,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:51,744 INFO L432 NwaCegarLoop]: 3105 mSDtfsCounter, 1471 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:51,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 6058 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:55:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2024-11-20 16:55:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3202. [2024-11-20 16:55:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 1754 states have (on average 1.944697833523375) internal successors, (3411), 3195 states have internal predecessors, (3411), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:55:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5419 transitions. [2024-11-20 16:55:51,973 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5419 transitions. Word has length 11 [2024-11-20 16:55:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:51,973 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 5419 transitions. [2024-11-20 16:55:51,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5419 transitions. [2024-11-20 16:55:51,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 16:55:51,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:51,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:55:51,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 16:55:52,174 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-20 16:55:52,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:52,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:52,180 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-20 16:55:52,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:52,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609652574] [2024-11-20 16:55:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:52,180 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-20 16:55:52,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:52,184 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-20 16:55:52,185 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-20 16:55:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:52,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:55:52,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:52,323 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-20 16:55:52,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:52,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609652574] [2024-11-20 16:55:52,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609652574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:52,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:52,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:55:52,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477860970] [2024-11-20 16:55:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:52,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:55:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:55:52,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:52,326 INFO L87 Difference]: Start difference. First operand 3202 states and 5419 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:52,374 INFO L93 Difference]: Finished difference Result 3142 states and 5333 transitions. [2024-11-20 16:55:52,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:55:52,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 16:55:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:52,387 INFO L225 Difference]: With dead ends: 3142 [2024-11-20 16:55:52,387 INFO L226 Difference]: Without dead ends: 3142 [2024-11-20 16:55:52,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:52,388 INFO L432 NwaCegarLoop]: 2982 mSDtfsCounter, 71 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5901 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:52,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5901 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:55:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-11-20 16:55:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3142. [2024-11-20 16:55:52,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 1718 states have (on average 1.9353899883585564) internal successors, (3325), 3135 states have internal predecessors, (3325), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:55:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 5333 transitions. [2024-11-20 16:55:52,645 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 5333 transitions. Word has length 13 [2024-11-20 16:55:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:52,645 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 5333 transitions. [2024-11-20 16:55:52,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 5333 transitions. [2024-11-20 16:55:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 16:55:52,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:52,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:55:52,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-20 16:55:52,847 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-20 16:55:52,848 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:52,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -133316320, now seen corresponding path program 1 times [2024-11-20 16:55:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301603952] [2024-11-20 16:55:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:52,849 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-20 16:55:52,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:52,852 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-20 16:55:52,854 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-20 16:55:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:52,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:55:52,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:53,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:55:53,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 16:55:53,012 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 33 treesize of output 31 [2024-11-20 16:55:53,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 16:55:53,050 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 62 treesize of output 22 [2024-11-20 16:55:53,082 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-20 16:55:53,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:53,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:53,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301603952] [2024-11-20 16:55:53,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301603952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:53,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:53,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:55:53,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449343181] [2024-11-20 16:55:53,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:53,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:55:53,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:53,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:55:53,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:55:53,085 INFO L87 Difference]: Start difference. First operand 3142 states and 5333 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:54,577 INFO L93 Difference]: Finished difference Result 5952 states and 10146 transitions. [2024-11-20 16:55:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:55:54,577 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 16:55:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:54,608 INFO L225 Difference]: With dead ends: 5952 [2024-11-20 16:55:54,608 INFO L226 Difference]: Without dead ends: 5952 [2024-11-20 16:55:54,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-20 16:55:54,609 INFO L432 NwaCegarLoop]: 3446 mSDtfsCounter, 1924 mSDsluCounter, 5906 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 9352 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:54,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 9352 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 16:55:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2024-11-20 16:55:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3141. [2024-11-20 16:55:54,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 1717 states have (on average 1.9353523587652883) internal successors, (3323), 3134 states have internal predecessors, (3323), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:55:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5331 transitions. [2024-11-20 16:55:54,999 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5331 transitions. Word has length 14 [2024-11-20 16:55:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:54,999 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5331 transitions. [2024-11-20 16:55:54,999 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:54,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5331 transitions. [2024-11-20 16:55:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 16:55:55,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:55,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:55:55,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 16:55:55,200 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-20 16:55:55,201 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:55,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-20 16:55:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594758234] [2024-11-20 16:55:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:55,202 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-20 16:55:55,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:55,205 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-20 16:55:55,206 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-20 16:55:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:55,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 16:55:55,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:55,368 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-20 16:55:55,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:55,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:55,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594758234] [2024-11-20 16:55:55,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594758234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:55,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:55,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:55:55,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373201434] [2024-11-20 16:55:55,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:55,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 16:55:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:55,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 16:55:55,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:55,371 INFO L87 Difference]: Start difference. First operand 3141 states and 5331 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:55,408 INFO L93 Difference]: Finished difference Result 3081 states and 5245 transitions. [2024-11-20 16:55:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 16:55:55,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 16:55:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:55,417 INFO L225 Difference]: With dead ends: 3081 [2024-11-20 16:55:55,417 INFO L226 Difference]: Without dead ends: 3081 [2024-11-20 16:55:55,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 16:55:55,420 INFO L432 NwaCegarLoop]: 2939 mSDtfsCounter, 71 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5815 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:55,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5815 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:55:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2024-11-20 16:55:55,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3081. [2024-11-20 16:55:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 1681 states have (on average 1.925639500297442) internal successors, (3237), 3074 states have internal predecessors, (3237), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:55:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 5245 transitions. [2024-11-20 16:55:55,635 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 5245 transitions. Word has length 18 [2024-11-20 16:55:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:55,635 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 5245 transitions. [2024-11-20 16:55:55,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 5245 transitions. [2024-11-20 16:55:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 16:55:55,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:55,636 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] [2024-11-20 16:55:55,641 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 (10)] Forceful destruction successful, exit code 0 [2024-11-20 16:55:55,839 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-20 16:55:55,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:55,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-20 16:55:55,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:55,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270979156] [2024-11-20 16:55:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:55,841 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-20 16:55:55,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:55,844 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 16:55:55,845 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-20 16:55:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:55,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:55:55,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:56,011 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-20 16:55:56,012 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:56,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270979156] [2024-11-20 16:55:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270979156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:56,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:56,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:55:56,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201773066] [2024-11-20 16:55:56,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:56,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:55:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:56,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:55:56,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:55:56,013 INFO L87 Difference]: Start difference. First operand 3081 states and 5245 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:55:56,105 INFO L93 Difference]: Finished difference Result 3051 states and 5187 transitions. [2024-11-20 16:55:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:55:56,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-20 16:55:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:55:56,113 INFO L225 Difference]: With dead ends: 3051 [2024-11-20 16:55:56,114 INFO L226 Difference]: Without dead ends: 3051 [2024-11-20 16:55:56,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-20 16:55:56,114 INFO L432 NwaCegarLoop]: 2894 mSDtfsCounter, 48 mSDsluCounter, 5762 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8656 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:55:56,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8656 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:55:56,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2024-11-20 16:55:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3051. [2024-11-20 16:55:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3051 states, 1665 states have (on average 1.9093093093093092) internal successors, (3179), 3044 states have internal predecessors, (3179), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:55:56,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 5187 transitions. [2024-11-20 16:55:56,429 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 5187 transitions. Word has length 20 [2024-11-20 16:55:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:55:56,430 INFO L471 AbstractCegarLoop]: Abstraction has 3051 states and 5187 transitions. [2024-11-20 16:55:56,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:55:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 5187 transitions. [2024-11-20 16:55:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 16:55:56,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:55:56,432 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] [2024-11-20 16:55:56,437 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-20 16:55:56,632 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-20 16:55:56,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:55:56,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:55:56,633 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-20 16:55:56,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:55:56,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955607809] [2024-11-20 16:55:56,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:55:56,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-20 16:55:56,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:55:56,635 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-20 16:55:56,636 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-20 16:55:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:55:56,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:55:56,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:55:56,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 16:55:56,932 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-20 16:55:56,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:55:56,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:55:56,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955607809] [2024-11-20 16:55:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955607809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:55:56,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:55:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:55:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293218212] [2024-11-20 16:55:56,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:55:56,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:55:56,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:55:56,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:55:56,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:55:56,935 INFO L87 Difference]: Start difference. First operand 3051 states and 5187 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:00,177 INFO L93 Difference]: Finished difference Result 3055 states and 5187 transitions. [2024-11-20 16:56:00,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:56:00,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 16:56:00,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:00,184 INFO L225 Difference]: With dead ends: 3055 [2024-11-20 16:56:00,184 INFO L226 Difference]: Without dead ends: 3055 [2024-11-20 16:56:00,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-20 16:56:00,185 INFO L432 NwaCegarLoop]: 2580 mSDtfsCounter, 1644 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 4124 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:00,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 4124 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-20 16:56:00,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-11-20 16:56:00,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3047. [2024-11-20 16:56:00,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 1665 states have (on average 1.9045045045045046) internal successors, (3171), 3040 states have internal predecessors, (3171), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:56:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 5179 transitions. [2024-11-20 16:56:00,401 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 5179 transitions. Word has length 34 [2024-11-20 16:56:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:00,403 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 5179 transitions. [2024-11-20 16:56:00,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 5179 transitions. [2024-11-20 16:56:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 16:56:00,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:00,405 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] [2024-11-20 16:56:00,410 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-20 16:56:00,609 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-20 16:56:00,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:00,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-20 16:56:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102783404] [2024-11-20 16:56:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:00,611 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-20 16:56:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:00,614 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-20 16:56:00,615 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-20 16:56:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:00,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 16:56:00,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:00,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-20 16:56:00,945 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-20 16:56:00,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:00,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:00,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102783404] [2024-11-20 16:56:00,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102783404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:00,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:00,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:00,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407931019] [2024-11-20 16:56:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:00,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:00,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:00,947 INFO L87 Difference]: Start difference. First operand 3047 states and 5179 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:04,510 INFO L93 Difference]: Finished difference Result 5346 states and 9500 transitions. [2024-11-20 16:56:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:56:04,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 16:56:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:04,528 INFO L225 Difference]: With dead ends: 5346 [2024-11-20 16:56:04,528 INFO L226 Difference]: Without dead ends: 5346 [2024-11-20 16:56:04,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-20 16:56:04,529 INFO L432 NwaCegarLoop]: 4937 mSDtfsCounter, 1391 mSDsluCounter, 5926 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 10863 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:04,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 10863 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-20 16:56:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2024-11-20 16:56:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 3043. [2024-11-20 16:56:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 1665 states have (on average 1.8996996996996998) internal successors, (3163), 3036 states have internal predecessors, (3163), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:56:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 5171 transitions. [2024-11-20 16:56:04,942 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 5171 transitions. Word has length 34 [2024-11-20 16:56:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:04,942 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 5171 transitions. [2024-11-20 16:56:04,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 5171 transitions. [2024-11-20 16:56:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-20 16:56:04,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:04,948 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, 1] [2024-11-20 16:56:04,954 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-20 16:56:05,149 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-20 16:56:05,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:05,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:05,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-20 16:56:05,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909342103] [2024-11-20 16:56:05,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:05,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 16:56:05,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:05,154 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-20 16:56:05,155 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-20 16:56:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:05,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:56:05,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:05,431 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-20 16:56:05,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:05,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:05,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909342103] [2024-11-20 16:56:05,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909342103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:05,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:05,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:56:05,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63498868] [2024-11-20 16:56:05,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:05,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:05,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:05,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:05,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:05,435 INFO L87 Difference]: Start difference. First operand 3043 states and 5171 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:05,520 INFO L93 Difference]: Finished difference Result 3031 states and 5151 transitions. [2024-11-20 16:56:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 16:56:05,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-20 16:56:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:05,529 INFO L225 Difference]: With dead ends: 3031 [2024-11-20 16:56:05,529 INFO L226 Difference]: Without dead ends: 3031 [2024-11-20 16:56:05,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-20 16:56:05,531 INFO L432 NwaCegarLoop]: 2888 mSDtfsCounter, 21 mSDsluCounter, 5745 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8633 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:05,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8633 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:56:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2024-11-20 16:56:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 3031. [2024-11-20 16:56:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 1653 states have (on average 1.9013914095583786) internal successors, (3143), 3024 states have internal predecessors, (3143), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:56:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 5151 transitions. [2024-11-20 16:56:05,806 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 5151 transitions. Word has length 53 [2024-11-20 16:56:05,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:05,806 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 5151 transitions. [2024-11-20 16:56:05,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:05,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 5151 transitions. [2024-11-20 16:56:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 16:56:05,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:05,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:05,815 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-20 16:56:06,008 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-20 16:56:06,009 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:06,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-20 16:56:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214819642] [2024-11-20 16:56:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:06,011 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-20 16:56:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:06,014 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-20 16:56:06,016 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-20 16:56:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:06,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 16:56:06,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:06,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 16:56:06,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-20 16:56:06,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 16:56:06,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 16:56:06,925 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 16:56:06,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 16:56:06,941 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-20 16:56:06,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:06,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:06,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214819642] [2024-11-20 16:56:06,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214819642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:06,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:06,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 16:56:06,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047863408] [2024-11-20 16:56:06,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:06,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:06,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:06,942 INFO L87 Difference]: Start difference. First operand 3031 states and 5151 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:09,023 INFO L93 Difference]: Finished difference Result 2993 states and 5113 transitions. [2024-11-20 16:56:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:56:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-20 16:56:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:09,033 INFO L225 Difference]: With dead ends: 2993 [2024-11-20 16:56:09,033 INFO L226 Difference]: Without dead ends: 2993 [2024-11-20 16:56:09,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:09,034 INFO L432 NwaCegarLoop]: 2459 mSDtfsCounter, 1570 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:09,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 2641 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 16:56:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2024-11-20 16:56:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2956. [2024-11-20 16:56:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 1616 states have (on average 1.875618811881188) internal successors, (3031), 2949 states have internal predecessors, (3031), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:56:09,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 5039 transitions. [2024-11-20 16:56:09,261 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 5039 transitions. Word has length 61 [2024-11-20 16:56:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:09,261 INFO L471 AbstractCegarLoop]: Abstraction has 2956 states and 5039 transitions. [2024-11-20 16:56:09,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:09,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 5039 transitions. [2024-11-20 16:56:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 16:56:09,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:09,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:09,271 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-20 16:56:09,466 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-20 16:56:09,467 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:09,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:09,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-20 16:56:09,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:09,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237115384] [2024-11-20 16:56:09,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:09,468 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-20 16:56:09,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:09,471 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-20 16:56:09,472 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-20 16:56:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:09,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 16:56:09,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:09,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 16:56:09,789 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 19 treesize of output 1 [2024-11-20 16:56:09,808 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 23 treesize of output 11 [2024-11-20 16:56:09,820 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-20 16:56:09,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:09,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237115384] [2024-11-20 16:56:09,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237115384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:09,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:09,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:56:09,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893212839] [2024-11-20 16:56:09,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:09,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:56:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:56:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:56:09,823 INFO L87 Difference]: Start difference. First operand 2956 states and 5039 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:11,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:11,411 INFO L93 Difference]: Finished difference Result 2955 states and 5038 transitions. [2024-11-20 16:56:11,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:56:11,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-20 16:56:11,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:11,421 INFO L225 Difference]: With dead ends: 2955 [2024-11-20 16:56:11,421 INFO L226 Difference]: Without dead ends: 2955 [2024-11-20 16:56:11,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:56:11,422 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 2 mSDsluCounter, 7372 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10233 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:11,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10233 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 16:56:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2024-11-20 16:56:11,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2024-11-20 16:56:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 1616 states have (on average 1.875) internal successors, (3030), 2948 states have internal predecessors, (3030), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:56:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 5038 transitions. [2024-11-20 16:56:11,652 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 5038 transitions. Word has length 66 [2024-11-20 16:56:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:11,653 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 5038 transitions. [2024-11-20 16:56:11,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 5038 transitions. [2024-11-20 16:56:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 16:56:11,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:11,654 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:11,663 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-20 16:56:11,854 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-20 16:56:11,854 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:11,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-20 16:56:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936059830] [2024-11-20 16:56:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:11,855 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-20 16:56:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:11,859 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-20 16:56:11,860 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-20 16:56:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:12,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 16:56:12,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:12,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-20 16:56:12,180 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 13 treesize of output 9 [2024-11-20 16:56:12,189 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 19 treesize of output 1 [2024-11-20 16:56:12,227 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 21 treesize of output 9 [2024-11-20 16:56:12,248 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-20 16:56:12,248 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:12,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936059830] [2024-11-20 16:56:12,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936059830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:12,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:12,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:56:12,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551483298] [2024-11-20 16:56:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:12,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 16:56:12,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:12,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 16:56:12,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 16:56:12,250 INFO L87 Difference]: Start difference. First operand 2955 states and 5038 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:13,970 INFO L93 Difference]: Finished difference Result 2954 states and 5037 transitions. [2024-11-20 16:56:13,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 16:56:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-20 16:56:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:13,978 INFO L225 Difference]: With dead ends: 2954 [2024-11-20 16:56:13,978 INFO L226 Difference]: Without dead ends: 2954 [2024-11-20 16:56:13,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 16:56:13,979 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 1 mSDsluCounter, 7405 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10266 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:13,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10266 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 16:56:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2024-11-20 16:56:14,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2954. [2024-11-20 16:56:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 1615 states have (on average 1.8755417956656346) internal successors, (3029), 2947 states have internal predecessors, (3029), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-20 16:56:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 5037 transitions. [2024-11-20 16:56:14,197 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 5037 transitions. Word has length 66 [2024-11-20 16:56:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:14,198 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 5037 transitions. [2024-11-20 16:56:14,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 16:56:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 5037 transitions. [2024-11-20 16:56:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-20 16:56:14,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:14,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 16:56:14,207 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 (17)] Ended with exit code 0 [2024-11-20 16:56:14,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-20 16:56:14,403 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash -620255098, now seen corresponding path program 1 times [2024-11-20 16:56:14,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:14,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142467722] [2024-11-20 16:56:14,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:14,404 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-20 16:56:14,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:14,407 INFO L229 MonitoredProcess]: Starting monitored process 18 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-20 16:56:14,409 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 (18)] Waiting until timeout for monitored process [2024-11-20 16:56:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:14,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 16:56:14,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:14,729 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-20 16:56:14,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 16:56:14,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:14,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142467722] [2024-11-20 16:56:14,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142467722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 16:56:14,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 16:56:14,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 16:56:14,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401285933] [2024-11-20 16:56:14,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 16:56:14,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 16:56:14,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 16:56:14,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 16:56:14,734 INFO L87 Difference]: Start difference. First operand 2954 states and 5037 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:56:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:14,800 INFO L93 Difference]: Finished difference Result 2957 states and 5041 transitions. [2024-11-20 16:56:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 16:56:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-20 16:56:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:14,823 INFO L225 Difference]: With dead ends: 2957 [2024-11-20 16:56:14,824 INFO L226 Difference]: Without dead ends: 2957 [2024-11-20 16:56:14,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 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-20 16:56:14,825 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 0 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8578 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:14,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8578 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 16:56:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2024-11-20 16:56:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2024-11-20 16:56:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 1617 states have (on average 1.8750773036487323) internal successors, (3032), 2950 states have internal predecessors, (3032), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-20 16:56:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 5041 transitions. [2024-11-20 16:56:15,098 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 5041 transitions. Word has length 74 [2024-11-20 16:56:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:15,098 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 5041 transitions. [2024-11-20 16:56:15,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 16:56:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 5041 transitions. [2024-11-20 16:56:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 16:56:15,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:15,100 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, 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-20 16:56:15,109 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 (18)] Ended with exit code 0 [2024-11-20 16:56:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-20 16:56:15,304 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:15,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:15,305 INFO L85 PathProgramCache]: Analyzing trace with hash 537846652, now seen corresponding path program 1 times [2024-11-20 16:56:15,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:15,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219962288] [2024-11-20 16:56:15,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 16:56:15,305 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-20 16:56:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:15,307 INFO L229 MonitoredProcess]: Starting monitored process 19 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-20 16:56:15,308 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 (19)] Waiting until timeout for monitored process [2024-11-20 16:56:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 16:56:15,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 16:56:15,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:15,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:56:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:15,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219962288] [2024-11-20 16:56:15,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219962288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:56:15,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:56:15,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 16:56:15,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090011098] [2024-11-20 16:56:15,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:56:15,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 16:56:15,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:15,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 16:56:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 16:56:15,657 INFO L87 Difference]: Start difference. First operand 2957 states and 5041 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:15,793 INFO L93 Difference]: Finished difference Result 2969 states and 5058 transitions. [2024-11-20 16:56:15,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 16:56:15,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-20 16:56:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:15,827 INFO L225 Difference]: With dead ends: 2969 [2024-11-20 16:56:15,832 INFO L226 Difference]: Without dead ends: 2969 [2024-11-20 16:56:15,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 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-20 16:56:15,834 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 5 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14291 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:15,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14291 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 16:56:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2024-11-20 16:56:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2967. [2024-11-20 16:56:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 1626 states have (on average 1.8739237392373924) internal successors, (3047), 2959 states have internal predecessors, (3047), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-20 16:56:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 5056 transitions. [2024-11-20 16:56:16,191 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 5056 transitions. Word has length 75 [2024-11-20 16:56:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:16,191 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 5056 transitions. [2024-11-20 16:56:16,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 5056 transitions. [2024-11-20 16:56:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-20 16:56:16,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:16,193 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 16:56:16,202 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 (19)] Forceful destruction successful, exit code 0 [2024-11-20 16:56:16,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-20 16:56:16,394 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:16,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2139507194, now seen corresponding path program 2 times [2024-11-20 16:56:16,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:16,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3991951] [2024-11-20 16:56:16,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 16:56:16,396 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-20 16:56:16,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:16,399 INFO L229 MonitoredProcess]: Starting monitored process 20 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-20 16:56:16,401 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 (20)] Waiting until timeout for monitored process [2024-11-20 16:56:16,877 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 16:56:16,878 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:56:16,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 16:56:16,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:16,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:56:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:17,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:17,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3991951] [2024-11-20 16:56:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3991951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:56:17,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:56:17,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 16:56:17,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257799741] [2024-11-20 16:56:17,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:56:17,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 16:56:17,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:17,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 16:56:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 16:56:17,077 INFO L87 Difference]: Start difference. First operand 2967 states and 5056 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:17,548 INFO L93 Difference]: Finished difference Result 2982 states and 5078 transitions. [2024-11-20 16:56:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 16:56:17,549 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-20 16:56:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:17,558 INFO L225 Difference]: With dead ends: 2982 [2024-11-20 16:56:17,558 INFO L226 Difference]: Without dead ends: 2978 [2024-11-20 16:56:17,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-20 16:56:17,559 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 11 mSDsluCounter, 17150 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20011 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:17,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20011 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 16:56:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2024-11-20 16:56:17,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2024-11-20 16:56:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 1635 states have (on average 1.8709480122324158) internal successors, (3059), 2968 states have internal predecessors, (3059), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-20 16:56:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5068 transitions. [2024-11-20 16:56:17,778 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5068 transitions. Word has length 78 [2024-11-20 16:56:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:17,778 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5068 transitions. [2024-11-20 16:56:17,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5068 transitions. [2024-11-20 16:56:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 16:56:17,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:17,780 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 16:56:17,790 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 (20)] Ended with exit code 0 [2024-11-20 16:56:17,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-20 16:56:17,980 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:17,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:17,981 INFO L85 PathProgramCache]: Analyzing trace with hash -114974138, now seen corresponding path program 3 times [2024-11-20 16:56:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192174083] [2024-11-20 16:56:17,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 16:56:17,981 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-20 16:56:17,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:17,983 INFO L229 MonitoredProcess]: Starting monitored process 21 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-20 16:56:17,984 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 (21)] Waiting until timeout for monitored process [2024-11-20 16:56:18,692 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 16:56:18,692 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:56:18,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 16:56:18,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:18,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:56:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:19,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192174083] [2024-11-20 16:56:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192174083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:56:19,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:56:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 16:56:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411581127] [2024-11-20 16:56:19,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:56:19,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 16:56:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 16:56:19,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 16:56:19,279 INFO L87 Difference]: Start difference. First operand 2976 states and 5068 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:20,698 INFO L93 Difference]: Finished difference Result 3000 states and 5107 transitions. [2024-11-20 16:56:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 16:56:20,699 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-20 16:56:20,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:20,709 INFO L225 Difference]: With dead ends: 3000 [2024-11-20 16:56:20,710 INFO L226 Difference]: Without dead ends: 2994 [2024-11-20 16:56:20,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 16:56:20,711 INFO L432 NwaCegarLoop]: 2862 mSDtfsCounter, 23 mSDsluCounter, 34307 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37169 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:20,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37169 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 16:56:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-11-20 16:56:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2994. [2024-11-20 16:56:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 1653 states have (on average 1.8644888082274653) internal successors, (3082), 2986 states have internal predecessors, (3082), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-20 16:56:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 5091 transitions. [2024-11-20 16:56:20,949 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 5091 transitions. Word has length 84 [2024-11-20 16:56:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:20,949 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 5091 transitions. [2024-11-20 16:56:20,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 5091 transitions. [2024-11-20 16:56:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 16:56:20,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:20,950 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 16:56:20,962 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 (21)] Forceful destruction successful, exit code 0 [2024-11-20 16:56:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-20 16:56:21,151 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1196758330, now seen corresponding path program 4 times [2024-11-20 16:56:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006979262] [2024-11-20 16:56:21,152 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 16:56:21,153 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-20 16:56:21,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:21,156 INFO L229 MonitoredProcess]: Starting monitored process 22 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-20 16:56:21,158 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 (22)] Waiting until timeout for monitored process [2024-11-20 16:56:21,613 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 16:56:21,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:56:21,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 16:56:21,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:22,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:56:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 16:56:23,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006979262] [2024-11-20 16:56:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006979262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 16:56:23,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 16:56:23,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 16:56:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638585931] [2024-11-20 16:56:23,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 16:56:23,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 16:56:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 16:56:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 16:56:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 16:56:23,173 INFO L87 Difference]: Start difference. First operand 2994 states and 5091 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 16:56:27,648 INFO L93 Difference]: Finished difference Result 3034 states and 5163 transitions. [2024-11-20 16:56:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 16:56:27,649 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-20 16:56:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 16:56:27,657 INFO L225 Difference]: With dead ends: 3034 [2024-11-20 16:56:27,658 INFO L226 Difference]: Without dead ends: 3030 [2024-11-20 16:56:27,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 16:56:27,661 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 47 mSDsluCounter, 74305 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 77166 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 16:56:27,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 77166 Invalid, 2003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 16:56:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-20 16:56:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3028. [2024-11-20 16:56:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1687 states have (on average 1.8541790160047422) internal successors, (3128), 3020 states have internal predecessors, (3128), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-20 16:56:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5137 transitions. [2024-11-20 16:56:27,907 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5137 transitions. Word has length 96 [2024-11-20 16:56:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 16:56:27,907 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5137 transitions. [2024-11-20 16:56:27,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 16:56:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5137 transitions. [2024-11-20 16:56:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 16:56:27,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 16:56:27,908 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 16:56:27,921 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 (22)] Ended with exit code 0 [2024-11-20 16:56:28,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-20 16:56:28,109 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-20 16:56:28,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 16:56:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1074332410, now seen corresponding path program 5 times [2024-11-20 16:56:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 16:56:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084301639] [2024-11-20 16:56:28,110 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:56:28,110 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-20 16:56:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 16:56:28,111 INFO L229 MonitoredProcess]: Starting monitored process 23 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-20 16:56:28,113 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 (23)] Waiting until timeout for monitored process [2024-11-20 16:56:29,207 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 16:56:29,207 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 16:56:29,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-20 16:56:29,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 16:56:29,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-20 16:56:29,343 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-20 16:56:29,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-20 16:56:29,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 16:56:29,463 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 24 treesize of output 12 [2024-11-20 16:56:30,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 16:56:30,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-20 16:56:30,369 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 33 treesize of output 15 [2024-11-20 16:56:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 16:56:30,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 16:56:30,747 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-20 16:56:30,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 16:56:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084301639] [2024-11-20 16:56:30,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084301639] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 16:56:30,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929190800] [2024-11-20 16:56:30,749 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 16:56:30,749 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 16:56:30,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 16:56:30,751 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 16:56:30,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process