./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-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 dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:55:30,606 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:55:30,664 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 15:55:30,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:55:30,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:55:30,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:55:30,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:55:30,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:55:30,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:55:30,705 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:55:30,705 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:55:30,706 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:55:30,706 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:55:30,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:55:30,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:55:30,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:55:30,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:55:30,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:55:30,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:55:30,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:55:30,709 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:55:30,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:55:30,710 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:55:30,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:55:30,712 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:55:30,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:55:30,712 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:55:30,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:55:30,713 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:55:30,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:55:30,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:55:30,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:55:30,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:55:30,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:55:30,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:55:30,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:55:30,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 15:55:30,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 15:55:30,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:55:30,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:55:30,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:55:30,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:55:30,715 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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2024-11-12 15:55:30,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:55:30,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:55:30,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:55:30,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:55:30,926 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:55:30,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-12 15:55:32,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:55:32,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:55:32,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-12 15:55:32,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8089812/4cfa24fce815404bbbaf1129d02240e4/FLAGce0f30e6b [2024-11-12 15:55:32,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8089812/4cfa24fce815404bbbaf1129d02240e4 [2024-11-12 15:55:32,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:55:32,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:55:32,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:55:32,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:55:32,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:55:32,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:55:32" (1/1) ... [2024-11-12 15:55:32,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59cb46a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:32, skipping insertion in model container [2024-11-12 15:55:32,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:55:32" (1/1) ... [2024-11-12 15:55:32,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:55:33,000 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,029 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,038 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,081 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,084 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,086 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,087 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,090 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,091 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,093 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,095 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,099 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,100 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,101 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,102 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,105 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:33,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:55:33,129 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 15:55:33,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@40bf7c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:33, skipping insertion in model container [2024-11-12 15:55:33,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:55:33,130 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 15:55:33,131 INFO L158 Benchmark]: Toolchain (without parser) took 482.46ms. Allocated memory is still 182.5MB. Free memory was 150.3MB in the beginning and 125.6MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 15:55:33,132 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 15:55:33,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.03ms. Allocated memory is still 182.5MB. Free memory was 150.3MB in the beginning and 125.6MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 15:55:33,133 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.14ms. Allocated memory is still 134.2MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.03ms. Allocated memory is still 182.5MB. Free memory was 150.3MB in the beginning and 125.6MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 778]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-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 dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 15:55:34,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 15:55:34,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 15:55:34,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 15:55:34,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 15:55:34,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 15:55:34,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 15:55:34,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 15:55:34,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 15:55:34,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 15:55:34,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 15:55:34,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 15:55:34,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 15:55:34,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 15:55:34,726 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 15:55:34,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 15:55:34,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 15:55:34,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 15:55:34,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 15:55:34,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 15:55:34,728 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 15:55:34,730 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 15:55:34,731 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 15:55:34,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 15:55:34,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 15:55:34,731 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 15:55:34,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 15:55:34,732 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 15:55:34,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 15:55:34,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 15:55:34,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 15:55:34,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 15:55:34,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 15:55:34,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 15:55:34,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 15:55:34,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:55:34,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 15:55:34,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 15:55:34,735 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 15:55:34,735 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 15:55:34,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 15:55:34,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 15:55:34,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 15:55:34,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 15:55:34,736 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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2024-11-12 15:55:34,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 15:55:35,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 15:55:35,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 15:55:35,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 15:55:35,017 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 15:55:35,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-12 15:55:36,234 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 15:55:36,496 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 15:55:36,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-12 15:55:36,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5624d5c59/6e01cef3562c404c8334ccf5acd975d1/FLAG22948810d [2024-11-12 15:55:36,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5624d5c59/6e01cef3562c404c8334ccf5acd975d1 [2024-11-12 15:55:36,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 15:55:36,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 15:55:36,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 15:55:36,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 15:55:36,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 15:55:36,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:55:36" (1/1) ... [2024-11-12 15:55:36,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cca0f38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:36, skipping insertion in model container [2024-11-12 15:55:36,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:55:36" (1/1) ... [2024-11-12 15:55:36,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:55:36,908 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,936 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,941 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,944 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,948 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,980 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,980 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,982 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,983 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,985 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,987 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,987 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,988 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,990 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,992 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,992 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,993 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,993 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:36,998 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:55:37,019 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 15:55:37,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 15:55:37,056 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,069 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,074 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,084 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,108 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,111 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,113 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,113 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,115 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,116 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,119 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,122 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,125 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,128 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,128 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,128 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,130 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 15:55:37,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:55:37,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 15:55:37,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 15:55:37,262 INFO L204 MainTranslator]: Completed translation [2024-11-12 15:55:37,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37 WrapperNode [2024-11-12 15:55:37,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 15:55:37,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 15:55:37,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 15:55:37,264 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 15:55:37,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,356 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1204 [2024-11-12 15:55:37,357 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 15:55:37,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 15:55:37,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 15:55:37,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 15:55:37,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,464 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-11-12 15:55:37,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 15:55:37,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 15:55:37,558 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 15:55:37,558 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 15:55:37,558 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (1/1) ... [2024-11-12 15:55:37,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 15:55:37,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 15:55:37,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 15:55:37,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 15:55:37,633 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 15:55:37,634 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 15:55:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 15:55:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 15:55:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 15:55:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 15:55:37,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 15:55:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 15:55:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 15:55:37,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 15:55:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 15:55:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 15:55:37,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 15:55:37,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 15:55:37,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 15:55:37,636 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 15:55:37,636 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-12 15:55:37,636 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 15:55:37,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 15:55:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 15:55:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 15:55:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 15:55:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 15:55:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 15:55:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 15:55:37,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 15:55:37,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 15:55:37,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 15:55:37,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 15:55:37,821 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 15:55:37,838 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:55:37,866 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:55:37,887 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-12 15:55:40,640 INFO L? ?]: Removed 1322 outVars from TransFormulas that were not future-live. [2024-11-12 15:55:40,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 15:55:40,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 15:55:40,665 INFO L316 CfgBuilder]: Removed 71 assume(true) statements. [2024-11-12 15:55:40,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:55:40 BoogieIcfgContainer [2024-11-12 15:55:40,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 15:55:40,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 15:55:40,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 15:55:40,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 15:55:40,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:55:36" (1/3) ... [2024-11-12 15:55:40,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e53d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:55:40, skipping insertion in model container [2024-11-12 15:55:40,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:55:37" (2/3) ... [2024-11-12 15:55:40,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e53d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:55:40, skipping insertion in model container [2024-11-12 15:55:40,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:55:40" (3/3) ... [2024-11-12 15:55:40,674 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-2.i [2024-11-12 15:55:40,685 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 15:55:40,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2024-11-12 15:55:40,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 15:55:40,743 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;@3ad3650c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 15:55:40,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2024-11-12 15:55:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 1300 states, 642 states have (on average 2.2274143302180685) internal successors, (1430), 1290 states have internal predecessors, (1430), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 15:55:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:55:40,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:40,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:55:40,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:40,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash 158947, now seen corresponding path program 1 times [2024-11-12 15:55:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749731712] [2024-11-12 15:55:40,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:40,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:40,769 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:40,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 15:55:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:40,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:55:40,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:40,963 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-12 15:55:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:40,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:40,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:40,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749731712] [2024-11-12 15:55:40,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749731712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:40,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:55:40,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190993278] [2024-11-12 15:55:40,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:40,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:55:40,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:55:41,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:55:41,029 INFO L87 Difference]: Start difference. First operand has 1300 states, 642 states have (on average 2.2274143302180685) internal successors, (1430), 1290 states have internal predecessors, (1430), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) 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-12 15:55:42,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:42,389 INFO L93 Difference]: Finished difference Result 1482 states and 1589 transitions. [2024-11-12 15:55:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:55:42,391 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-12 15:55:42,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:42,404 INFO L225 Difference]: With dead ends: 1482 [2024-11-12 15:55:42,404 INFO L226 Difference]: Without dead ends: 1480 [2024-11-12 15:55:42,405 INFO L434 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-12 15:55:42,407 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 1153 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:42,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1062 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:55:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2024-11-12 15:55:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1289. [2024-11-12 15:55:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 647 states have (on average 2.081916537867079) internal successors, (1347), 1278 states have internal predecessors, (1347), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 15:55:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1391 transitions. [2024-11-12 15:55:42,469 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1391 transitions. Word has length 3 [2024-11-12 15:55:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:42,469 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1391 transitions. [2024-11-12 15:55:42,469 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-12 15:55:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1391 transitions. [2024-11-12 15:55:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-12 15:55:42,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:42,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-12 15:55:42,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 15:55:42,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:42,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:42,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash 158948, now seen corresponding path program 1 times [2024-11-12 15:55:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802669154] [2024-11-12 15:55:42,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:42,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:42,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:42,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:42,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 15:55:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:42,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:55:42,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:42,757 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-12 15:55:42,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:42,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:42,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:42,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802669154] [2024-11-12 15:55:42,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802669154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:42,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:55:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985560917] [2024-11-12 15:55:42,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:42,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:55:42,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:42,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:55:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:55:42,768 INFO L87 Difference]: Start difference. First operand 1289 states and 1391 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-12 15:55:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:44,546 INFO L93 Difference]: Finished difference Result 1891 states and 2036 transitions. [2024-11-12 15:55:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:55:44,547 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-12 15:55:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:44,552 INFO L225 Difference]: With dead ends: 1891 [2024-11-12 15:55:44,552 INFO L226 Difference]: Without dead ends: 1891 [2024-11-12 15:55:44,552 INFO L434 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-12 15:55:44,554 INFO L435 NwaCegarLoop]: 1086 mSDtfsCounter, 641 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:44,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1842 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:55:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-12 15:55:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1501. [2024-11-12 15:55:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 859 states have (on average 2.067520372526193) internal successors, (1776), 1489 states have internal predecessors, (1776), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 15:55:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1822 transitions. [2024-11-12 15:55:44,579 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1822 transitions. Word has length 3 [2024-11-12 15:55:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:44,579 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 1822 transitions. [2024-11-12 15:55:44,580 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-12 15:55:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1822 transitions. [2024-11-12 15:55:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 15:55:44,580 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:44,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:55:44,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 15:55:44,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:44,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:44,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 765366893, now seen corresponding path program 1 times [2024-11-12 15:55:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522377775] [2024-11-12 15:55:44,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:44,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:44,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:44,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:44,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 15:55:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:44,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 15:55:44,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:44,903 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-12 15:55:44,909 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-12 15:55:44,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:55:44,960 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-12 15:55:44,974 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:55:44,974 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-12 15:55:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:44,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:44,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:44,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522377775] [2024-11-12 15:55:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522377775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:44,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:44,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:55:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775849101] [2024-11-12 15:55:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:44,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:55:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:45,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:55:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:55:45,000 INFO L87 Difference]: Start difference. First operand 1501 states and 1822 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-12 15:55:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:46,756 INFO L93 Difference]: Finished difference Result 1686 states and 2014 transitions. [2024-11-12 15:55:46,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:55:46,756 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-12 15:55:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:46,761 INFO L225 Difference]: With dead ends: 1686 [2024-11-12 15:55:46,761 INFO L226 Difference]: Without dead ends: 1686 [2024-11-12 15:55:46,761 INFO L434 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-12 15:55:46,763 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 2607 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:46,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 664 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-12 15:55:46,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-12 15:55:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1277. [2024-11-12 15:55:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 647 states have (on average 2.061823802163833) internal successors, (1334), 1266 states have internal predecessors, (1334), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 15:55:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1378 transitions. [2024-11-12 15:55:46,789 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1378 transitions. Word has length 7 [2024-11-12 15:55:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:46,790 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1378 transitions. [2024-11-12 15:55:46,791 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-12 15:55:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1378 transitions. [2024-11-12 15:55:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 15:55:46,791 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:46,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:55:46,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 15:55:46,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:46,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:46,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2043429998, now seen corresponding path program 1 times [2024-11-12 15:55:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:46,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637677000] [2024-11-12 15:55:46,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:47,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:47,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 15:55:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:47,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:55:47,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:47,100 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-12 15:55:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:47,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:47,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:47,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637677000] [2024-11-12 15:55:47,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637677000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:47,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:47,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:55:47,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000142224] [2024-11-12 15:55:47,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:47,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:55:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:47,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:55:47,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:55:47,110 INFO L87 Difference]: Start difference. First operand 1277 states and 1378 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-12 15:55:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:48,312 INFO L93 Difference]: Finished difference Result 1611 states and 1741 transitions. [2024-11-12 15:55:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:55:48,312 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-12 15:55:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:48,316 INFO L225 Difference]: With dead ends: 1611 [2024-11-12 15:55:48,316 INFO L226 Difference]: Without dead ends: 1611 [2024-11-12 15:55:48,316 INFO L434 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-12 15:55:48,317 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 938 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:48,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1634 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 15:55:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-11-12 15:55:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1229. [2024-11-12 15:55:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 647 states have (on average 1.9860896445131375) internal successors, (1285), 1218 states have internal predecessors, (1285), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 15:55:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1329 transitions. [2024-11-12 15:55:48,332 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1329 transitions. Word has length 8 [2024-11-12 15:55:48,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:48,332 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1329 transitions. [2024-11-12 15:55:48,332 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-12 15:55:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1329 transitions. [2024-11-12 15:55:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 15:55:48,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:48,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:55:48,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 15:55:48,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:48,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:48,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:48,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2043429997, now seen corresponding path program 1 times [2024-11-12 15:55:48,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:48,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072853817] [2024-11-12 15:55:48,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:48,534 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:48,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:48,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 15:55:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:48,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:55:48,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:48,639 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-12 15:55:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:48,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:48,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:48,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072853817] [2024-11-12 15:55:48,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072853817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:48,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:48,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 15:55:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183257664] [2024-11-12 15:55:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:48,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:55:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:55:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:55:48,660 INFO L87 Difference]: Start difference. First operand 1229 states and 1329 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-12 15:55:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:50,184 INFO L93 Difference]: Finished difference Result 1712 states and 1848 transitions. [2024-11-12 15:55:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:55:50,185 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-12 15:55:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:50,189 INFO L225 Difference]: With dead ends: 1712 [2024-11-12 15:55:50,189 INFO L226 Difference]: Without dead ends: 1712 [2024-11-12 15:55:50,189 INFO L434 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-12 15:55:50,190 INFO L435 NwaCegarLoop]: 1423 mSDtfsCounter, 701 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:50,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 2019 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 15:55:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2024-11-12 15:55:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1484. [2024-11-12 15:55:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 910 states have (on average 1.9714285714285715) internal successors, (1794), 1471 states have internal predecessors, (1794), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 15:55:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1842 transitions. [2024-11-12 15:55:50,211 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1842 transitions. Word has length 8 [2024-11-12 15:55:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:50,211 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1842 transitions. [2024-11-12 15:55:50,211 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-12 15:55:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1842 transitions. [2024-11-12 15:55:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 15:55:50,212 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:50,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:55:50,217 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-12 15:55:50,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:50,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:50,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash 98792037, now seen corresponding path program 1 times [2024-11-12 15:55:50,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:50,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113526989] [2024-11-12 15:55:50,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:50,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:50,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:50,419 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:50,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 15:55:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:50,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:55:50,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:50,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:50,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:50,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113526989] [2024-11-12 15:55:50,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113526989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:50,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:50,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:55:50,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824832581] [2024-11-12 15:55:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:50,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:55:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:55:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:55:50,589 INFO L87 Difference]: Start difference. First operand 1484 states and 1842 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-12 15:55:50,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:50,817 INFO L93 Difference]: Finished difference Result 2256 states and 2870 transitions. [2024-11-12 15:55:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:55:50,817 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-12 15:55:50,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:50,823 INFO L225 Difference]: With dead ends: 2256 [2024-11-12 15:55:50,823 INFO L226 Difference]: Without dead ends: 2256 [2024-11-12 15:55:50,823 INFO L434 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-12 15:55:50,823 INFO L435 NwaCegarLoop]: 1443 mSDtfsCounter, 635 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:50,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 2630 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 15:55:50,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-11-12 15:55:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1893. [2024-11-12 15:55:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1317 states have (on average 1.9582384206529992) internal successors, (2579), 1878 states have internal predecessors, (2579), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2631 transitions. [2024-11-12 15:55:50,847 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2631 transitions. Word has length 11 [2024-11-12 15:55:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:50,847 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 2631 transitions. [2024-11-12 15:55:50,847 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-12 15:55:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2631 transitions. [2024-11-12 15:55:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 15:55:50,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:50,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:55:50,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 15:55:51,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:51,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:51,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash -149348106, now seen corresponding path program 1 times [2024-11-12 15:55:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86795330] [2024-11-12 15:55:51,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:51,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:51,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:51,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:51,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 15:55:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:51,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:55:51,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:51,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:51,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:51,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86795330] [2024-11-12 15:55:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86795330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:55:51,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505490628] [2024-11-12 15:55:51,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:51,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:55:51,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:51,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:55:51,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:55:51,152 INFO L87 Difference]: Start difference. First operand 1893 states and 2631 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-12 15:55:51,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:51,176 INFO L93 Difference]: Finished difference Result 1797 states and 2459 transitions. [2024-11-12 15:55:51,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:55:51,176 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-12 15:55:51,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:51,180 INFO L225 Difference]: With dead ends: 1797 [2024-11-12 15:55:51,180 INFO L226 Difference]: Without dead ends: 1797 [2024-11-12 15:55:51,180 INFO L434 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-12 15:55:51,181 INFO L435 NwaCegarLoop]: 1248 mSDtfsCounter, 71 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2433 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-12 15:55:51,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2433 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:55:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2024-11-12 15:55:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1797. [2024-11-12 15:55:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1245 states have (on average 1.9333333333333333) internal successors, (2407), 1782 states have internal predecessors, (2407), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2459 transitions. [2024-11-12 15:55:51,201 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2459 transitions. Word has length 13 [2024-11-12 15:55:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:51,202 INFO L471 AbstractCegarLoop]: Abstraction has 1797 states and 2459 transitions. [2024-11-12 15:55:51,202 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-12 15:55:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2459 transitions. [2024-11-12 15:55:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-12 15:55:51,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:51,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:55:51,206 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-12 15:55:51,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:51,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr632ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:51,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1068465001, now seen corresponding path program 1 times [2024-11-12 15:55:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085387688] [2024-11-12 15:55:51,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:51,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:51,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:51,408 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:51,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 (9)] Waiting until timeout for monitored process [2024-11-12 15:55:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:51,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:55:51,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:51,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:55:51,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:55:51,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 15:55:51,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-12 15:55:51,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 15:55:51,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-12 15:55:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:51,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:51,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085387688] [2024-11-12 15:55:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085387688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:55:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279113107] [2024-11-12 15:55:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:55:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:55:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:55:51,576 INFO L87 Difference]: Start difference. First operand 1797 states and 2459 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-12 15:55:51,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:51,753 INFO L93 Difference]: Finished difference Result 3149 states and 4219 transitions. [2024-11-12 15:55:51,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:55:51,753 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-12 15:55:51,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:51,760 INFO L225 Difference]: With dead ends: 3149 [2024-11-12 15:55:51,760 INFO L226 Difference]: Without dead ends: 3149 [2024-11-12 15:55:51,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:55:51,760 INFO L435 NwaCegarLoop]: 1233 mSDtfsCounter, 1122 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 3689 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:51,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 3689 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:55:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2024-11-12 15:55:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 1796. [2024-11-12 15:55:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1244 states have (on average 1.9332797427652733) internal successors, (2405), 1781 states have internal predecessors, (2405), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2457 transitions. [2024-11-12 15:55:51,787 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2457 transitions. Word has length 14 [2024-11-12 15:55:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:51,787 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2457 transitions. [2024-11-12 15:55:51,787 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-12 15:55:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2457 transitions. [2024-11-12 15:55:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 15:55:51,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:51,788 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 15:55:51,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 15:55:51,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:51,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:51,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash 114814847, now seen corresponding path program 1 times [2024-11-12 15:55:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352541989] [2024-11-12 15:55:51,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:51,991 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:51,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 15:55:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:52,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 15:55:52,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:52,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:52,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:52,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:52,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352541989] [2024-11-12 15:55:52,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352541989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:52,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:52,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:55:52,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90251713] [2024-11-12 15:55:52,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:52,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 15:55:52,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 15:55:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 15:55:52,137 INFO L87 Difference]: Start difference. First operand 1796 states and 2457 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-12 15:55:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:52,165 INFO L93 Difference]: Finished difference Result 1736 states and 2371 transitions. [2024-11-12 15:55:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 15:55:52,166 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-12 15:55:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:52,170 INFO L225 Difference]: With dead ends: 1736 [2024-11-12 15:55:52,170 INFO L226 Difference]: Without dead ends: 1736 [2024-11-12 15:55:52,170 INFO L434 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-12 15:55:52,172 INFO L435 NwaCegarLoop]: 1205 mSDtfsCounter, 71 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2347 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-12 15:55:52,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2347 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:55:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2024-11-12 15:55:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1736. [2024-11-12 15:55:52,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1208 states have (on average 1.919701986754967) internal successors, (2319), 1721 states have internal predecessors, (2319), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2371 transitions. [2024-11-12 15:55:52,198 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2371 transitions. Word has length 18 [2024-11-12 15:55:52,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:52,198 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2371 transitions. [2024-11-12 15:55:52,198 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-12 15:55:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2371 transitions. [2024-11-12 15:55:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 15:55:52,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:52,199 INFO L218 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-12 15:55:52,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 15:55:52,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:52,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:52,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1332082440, now seen corresponding path program 1 times [2024-11-12 15:55:52,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:52,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539915876] [2024-11-12 15:55:52,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:52,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:52,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:52,404 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:52,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 15:55:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:52,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:55:52,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:52,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:52,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:52,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539915876] [2024-11-12 15:55:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539915876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:52,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:55:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011432274] [2024-11-12 15:55:52,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:52,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:55:52,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:55:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:55:52,543 INFO L87 Difference]: Start difference. First operand 1736 states and 2371 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-12 15:55:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:52,591 INFO L93 Difference]: Finished difference Result 1706 states and 2313 transitions. [2024-11-12 15:55:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:55:52,592 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-12 15:55:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:52,597 INFO L225 Difference]: With dead ends: 1706 [2024-11-12 15:55:52,597 INFO L226 Difference]: Without dead ends: 1706 [2024-11-12 15:55:52,597 INFO L434 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-12 15:55:52,597 INFO L435 NwaCegarLoop]: 1160 mSDtfsCounter, 48 mSDsluCounter, 2294 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3454 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.0s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:52,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3454 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:55:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-11-12 15:55:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2024-11-12 15:55:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1192 states have (on average 1.8968120805369129) internal successors, (2261), 1691 states have internal predecessors, (2261), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2313 transitions. [2024-11-12 15:55:52,617 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2313 transitions. Word has length 20 [2024-11-12 15:55:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:52,618 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 2313 transitions. [2024-11-12 15:55:52,618 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-12 15:55:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2313 transitions. [2024-11-12 15:55:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 15:55:52,619 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:52,619 INFO L218 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-12 15:55:52,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 15:55:52,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:52,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:52,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1087784634, now seen corresponding path program 1 times [2024-11-12 15:55:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:52,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024129589] [2024-11-12 15:55:52,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:52,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-12 15:55:52,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:52,824 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:52,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 15:55:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:52,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:55:52,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:52,964 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-12 15:55:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:53,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:53,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:53,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024129589] [2024-11-12 15:55:53,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024129589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:53,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:53,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:55:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269386800] [2024-11-12 15:55:53,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:55:53,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:53,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:55:53,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:55:53,024 INFO L87 Difference]: Start difference. First operand 1706 states and 2313 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-12 15:55:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:54,249 INFO L93 Difference]: Finished difference Result 1723 states and 2329 transitions. [2024-11-12 15:55:54,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:55:54,253 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-12 15:55:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:54,258 INFO L225 Difference]: With dead ends: 1723 [2024-11-12 15:55:54,258 INFO L226 Difference]: Without dead ends: 1723 [2024-11-12 15:55:54,258 INFO L434 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-12 15:55:54,259 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 828 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:54,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1540 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 15:55:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2024-11-12 15:55:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1702. [2024-11-12 15:55:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1192 states have (on average 1.8901006711409396) internal successors, (2253), 1687 states have internal predecessors, (2253), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2305 transitions. [2024-11-12 15:55:54,276 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2305 transitions. Word has length 34 [2024-11-12 15:55:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:54,277 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2305 transitions. [2024-11-12 15:55:54,277 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-12 15:55:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2305 transitions. [2024-11-12 15:55:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 15:55:54,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:54,278 INFO L218 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-12 15:55:54,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-12 15:55:54,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:54,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:54,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:54,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1087784633, now seen corresponding path program 1 times [2024-11-12 15:55:54,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:54,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123252918] [2024-11-12 15:55:54,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:54,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:54,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:54,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:54,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 15:55:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:54,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:55:54,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:54,633 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-12 15:55:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:54,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:54,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123252918] [2024-11-12 15:55:54,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123252918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:54,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:54,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:55:54,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703098992] [2024-11-12 15:55:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:54,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:55:54,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:54,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:55:54,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:55:54,776 INFO L87 Difference]: Start difference. First operand 1702 states and 2305 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-12 15:55:56,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:56,593 INFO L93 Difference]: Finished difference Result 1911 states and 2312 transitions. [2024-11-12 15:55:56,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:55:56,594 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-12 15:55:56,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:56,598 INFO L225 Difference]: With dead ends: 1911 [2024-11-12 15:55:56,598 INFO L226 Difference]: Without dead ends: 1911 [2024-11-12 15:55:56,598 INFO L434 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-12 15:55:56,599 INFO L435 NwaCegarLoop]: 1413 mSDtfsCounter, 587 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:56,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 2884 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 15:55:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2024-11-12 15:55:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1698. [2024-11-12 15:55:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1192 states have (on average 1.8833892617449663) internal successors, (2245), 1683 states have internal predecessors, (2245), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2297 transitions. [2024-11-12 15:55:56,616 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2297 transitions. Word has length 34 [2024-11-12 15:55:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:56,616 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 2297 transitions. [2024-11-12 15:55:56,616 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-12 15:55:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2297 transitions. [2024-11-12 15:55:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 15:55:56,617 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:56,617 INFO L218 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-12 15:55:56,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 15:55:56,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:56,818 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:56,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 477063392, now seen corresponding path program 1 times [2024-11-12 15:55:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:56,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113653883] [2024-11-12 15:55:56,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:56,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:56,822 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:56,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 15:55:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:57,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:55:57,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:57,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:57,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:57,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113653883] [2024-11-12 15:55:57,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113653883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:57,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:57,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:55:57,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756571206] [2024-11-12 15:55:57,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:57,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:55:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:55:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:55:57,036 INFO L87 Difference]: Start difference. First operand 1698 states and 2297 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-12 15:55:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:57,079 INFO L93 Difference]: Finished difference Result 1686 states and 2277 transitions. [2024-11-12 15:55:57,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 15:55:57,079 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-12 15:55:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:57,085 INFO L225 Difference]: With dead ends: 1686 [2024-11-12 15:55:57,088 INFO L226 Difference]: Without dead ends: 1686 [2024-11-12 15:55:57,088 INFO L434 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-12 15:55:57,089 INFO L435 NwaCegarLoop]: 1154 mSDtfsCounter, 21 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3431 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-12 15:55:57,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3431 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:55:57,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-12 15:55:57,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1686. [2024-11-12 15:55:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1686 states, 1180 states have (on average 1.8855932203389831) internal successors, (2225), 1671 states have internal predecessors, (2225), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 15:55:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 2277 transitions. [2024-11-12 15:55:57,104 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 2277 transitions. Word has length 53 [2024-11-12 15:55:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:57,104 INFO L471 AbstractCegarLoop]: Abstraction has 1686 states and 2277 transitions. [2024-11-12 15:55:57,104 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-12 15:55:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 2277 transitions. [2024-11-12 15:55:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 15:55:57,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:57,105 INFO L218 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-12 15:55:57,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 15:55:57,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:57,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:57,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1964348524, now seen corresponding path program 1 times [2024-11-12 15:55:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:57,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177115733] [2024-11-12 15:55:57,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:57,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:57,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:57,309 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:57,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 15:55:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:57,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 15:55:57,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:57,556 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-12 15:55:57,560 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-12 15:55:57,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 15:55:57,878 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-12 15:55:57,899 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 15:55:57,900 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-12 15:55:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:57,911 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:57,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:57,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177115733] [2024-11-12 15:55:57,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177115733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:57,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:57,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 15:55:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465683549] [2024-11-12 15:55:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:57,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:55:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:57,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:55:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:55:57,912 INFO L87 Difference]: Start difference. First operand 1686 states and 2277 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-12 15:55:59,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:55:59,119 INFO L93 Difference]: Finished difference Result 1659 states and 2251 transitions. [2024-11-12 15:55:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:55:59,120 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-12 15:55:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:55:59,123 INFO L225 Difference]: With dead ends: 1659 [2024-11-12 15:55:59,123 INFO L226 Difference]: Without dead ends: 1659 [2024-11-12 15:55:59,123 INFO L434 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-12 15:55:59,123 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 772 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:55:59,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 904 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 15:55:59,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-11-12 15:55:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1257. [2024-11-12 15:55:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 794 states have (on average 1.8035264483627205) internal successors, (1432), 1245 states have internal predecessors, (1432), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 15:55:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1478 transitions. [2024-11-12 15:55:59,135 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1478 transitions. Word has length 61 [2024-11-12 15:55:59,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:55:59,135 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1478 transitions. [2024-11-12 15:55:59,135 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-12 15:55:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1478 transitions. [2024-11-12 15:55:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 15:55:59,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:55:59,136 INFO L218 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-12 15:55:59,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 (15)] Ended with exit code 0 [2024-11-12 15:55:59,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:59,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:55:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:55:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1594198879, now seen corresponding path program 1 times [2024-11-12 15:55:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:55:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119752922] [2024-11-12 15:55:59,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:55:59,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:55:59,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:55:59,339 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 15:55:59,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 15:55:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:55:59,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 15:55:59,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:55:59,547 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-12 15:55:59,558 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-12 15:55:59,580 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-12 15:55:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:55:59,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:55:59,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:55:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119752922] [2024-11-12 15:55:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119752922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:55:59,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:55:59,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:55:59,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094575632] [2024-11-12 15:55:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:55:59,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:55:59,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:55:59,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:55:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:55:59,591 INFO L87 Difference]: Start difference. First operand 1257 states and 1478 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-12 15:56:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:56:00,955 INFO L93 Difference]: Finished difference Result 1256 states and 1477 transitions. [2024-11-12 15:56:00,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:56:00,956 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-12 15:56:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:56:00,958 INFO L225 Difference]: With dead ends: 1256 [2024-11-12 15:56:00,958 INFO L226 Difference]: Without dead ends: 1256 [2024-11-12 15:56:00,958 INFO L434 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-12 15:56:00,959 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 2 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 15:56:00,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2983 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 15:56:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2024-11-12 15:56:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1256. [2024-11-12 15:56:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 794 states have (on average 1.8022670025188916) internal successors, (1431), 1244 states have internal predecessors, (1431), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 15:56:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 1477 transitions. [2024-11-12 15:56:00,968 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 1477 transitions. Word has length 66 [2024-11-12 15:56:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:56:00,968 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 1477 transitions. [2024-11-12 15:56:00,968 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-12 15:56:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 1477 transitions. [2024-11-12 15:56:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 15:56:00,969 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:56:00,969 INFO L218 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-12 15:56:00,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-12 15:56:01,169 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-12 15:56:01,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:56:01,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:56:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1594198880, now seen corresponding path program 1 times [2024-11-12 15:56:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:56:01,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389167883] [2024-11-12 15:56:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:56:01,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:56:01,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:56:01,171 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-12 15:56:01,172 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-12 15:56:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:56:01,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 15:56:01,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:56:01,393 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-12 15:56:01,407 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-12 15:56:01,413 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-12 15:56:01,439 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-12 15:56:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:56:01,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:56:01,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:56:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389167883] [2024-11-12 15:56:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389167883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:56:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:56:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:56:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052554688] [2024-11-12 15:56:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:56:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 15:56:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:56:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 15:56:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 15:56:01,451 INFO L87 Difference]: Start difference. First operand 1256 states and 1477 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-12 15:56:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:56:03,125 INFO L93 Difference]: Finished difference Result 1255 states and 1476 transitions. [2024-11-12 15:56:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 15:56:03,126 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-12 15:56:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:56:03,128 INFO L225 Difference]: With dead ends: 1255 [2024-11-12 15:56:03,128 INFO L226 Difference]: Without dead ends: 1255 [2024-11-12 15:56:03,128 INFO L434 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-12 15:56:03,128 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 1 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3039 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 15:56:03,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3039 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 15:56:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-12 15:56:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-12 15:56:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 793 states have (on average 1.8032786885245902) internal successors, (1430), 1243 states have internal predecessors, (1430), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 15:56:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1476 transitions. [2024-11-12 15:56:03,138 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1476 transitions. Word has length 66 [2024-11-12 15:56:03,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:56:03,139 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1476 transitions. [2024-11-12 15:56:03,139 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-12 15:56:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1476 transitions. [2024-11-12 15:56:03,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 15:56:03,140 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:56:03,140 INFO L218 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-12 15:56:03,146 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-12 15:56:03,340 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-12 15:56:03,340 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:56:03,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:56:03,341 INFO L85 PathProgramCache]: Analyzing trace with hash -572666778, now seen corresponding path program 1 times [2024-11-12 15:56:03,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:56:03,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364145826] [2024-11-12 15:56:03,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:56:03,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:56:03,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:56:03,342 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-12 15:56:03,343 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-12 15:56:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:56:03,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 15:56:03,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:56:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 15:56:03,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 15:56:03,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:56:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364145826] [2024-11-12 15:56:03,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364145826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 15:56:03,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 15:56:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 15:56:03,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872967389] [2024-11-12 15:56:03,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 15:56:03,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 15:56:03,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:56:03,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 15:56:03,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 15:56:03,554 INFO L87 Difference]: Start difference. First operand 1255 states and 1476 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-12 15:56:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:56:03,579 INFO L93 Difference]: Finished difference Result 1258 states and 1480 transitions. [2024-11-12 15:56:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 15:56:03,580 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-12 15:56:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:56:03,582 INFO L225 Difference]: With dead ends: 1258 [2024-11-12 15:56:03,582 INFO L226 Difference]: Without dead ends: 1258 [2024-11-12 15:56:03,582 INFO L434 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-12 15:56:03,583 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 0 mSDsluCounter, 2245 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3370 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-12 15:56:03,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3370 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 15:56:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-12 15:56:03,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1258. [2024-11-12 15:56:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 795 states have (on average 1.8025157232704403) internal successors, (1433), 1246 states have internal predecessors, (1433), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-12 15:56:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1480 transitions. [2024-11-12 15:56:03,623 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1480 transitions. Word has length 74 [2024-11-12 15:56:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:56:03,623 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1480 transitions. [2024-11-12 15:56:03,624 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-12 15:56:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1480 transitions. [2024-11-12 15:56:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 15:56:03,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:56:03,624 INFO L218 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-12 15:56:03,632 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-12 15:56:03,824 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-12 15:56:03,825 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:56:03,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:56:03,825 INFO L85 PathProgramCache]: Analyzing trace with hash 61894504, now seen corresponding path program 1 times [2024-11-12 15:56:03,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:56:03,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893990731] [2024-11-12 15:56:03,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 15:56:03,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:56:03,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:56:03,827 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-12 15:56:03,828 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-12 15:56:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 15:56:04,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 15:56:04,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:56:04,040 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-12 15:56:04,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:56:04,084 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-12 15:56:04,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:56:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893990731] [2024-11-12 15:56:04,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893990731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:56:04,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:56:04,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 15:56:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906333485] [2024-11-12 15:56:04,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:56:04,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 15:56:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:56:04,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 15:56:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 15:56:04,085 INFO L87 Difference]: Start difference. First operand 1258 states and 1480 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-12 15:56:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:56:04,175 INFO L93 Difference]: Finished difference Result 1270 states and 1497 transitions. [2024-11-12 15:56:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 15:56:04,176 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-12 15:56:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:56:04,178 INFO L225 Difference]: With dead ends: 1270 [2024-11-12 15:56:04,178 INFO L226 Difference]: Without dead ends: 1270 [2024-11-12 15:56:04,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-12 15:56:04,178 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 8 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 15:56:04,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3372 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 15:56:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-11-12 15:56:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2024-11-12 15:56:04,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 804 states have (on average 1.800995024875622) internal successors, (1448), 1255 states have internal predecessors, (1448), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-12 15:56:04,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1495 transitions. [2024-11-12 15:56:04,198 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1495 transitions. Word has length 75 [2024-11-12 15:56:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:56:04,198 INFO L471 AbstractCegarLoop]: Abstraction has 1268 states and 1495 transitions. [2024-11-12 15:56:04,199 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-12 15:56:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1495 transitions. [2024-11-12 15:56:04,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 15:56:04,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:56:04,199 INFO L218 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-12 15:56:04,208 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 (19)] Ended with exit code 0 [2024-11-12 15:56:04,399 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-12 15:56:04,400 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:56:04,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:56:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash 250576102, now seen corresponding path program 2 times [2024-11-12 15:56:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:56:04,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59771605] [2024-11-12 15:56:04,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 15:56:04,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:56:04,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:56:04,403 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-12 15:56:04,407 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-12 15:56:04,748 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 15:56:04,748 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:56:04,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 15:56:04,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:56:04,788 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-12 15:56:04,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:56:04,878 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-12 15:56:04,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:56:04,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59771605] [2024-11-12 15:56:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59771605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:56:04,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:56:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 15:56:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562134775] [2024-11-12 15:56:04,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:56:04,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 15:56:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:56:04,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 15:56:04,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 15:56:04,880 INFO L87 Difference]: Start difference. First operand 1268 states and 1495 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-12 15:56:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:56:05,186 INFO L93 Difference]: Finished difference Result 1283 states and 1517 transitions. [2024-11-12 15:56:05,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 15:56:05,187 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-12 15:56:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:56:05,189 INFO L225 Difference]: With dead ends: 1283 [2024-11-12 15:56:05,189 INFO L226 Difference]: Without dead ends: 1279 [2024-11-12 15:56:05,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 15:56:05,190 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 14 mSDsluCounter, 6734 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7859 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 15:56:05,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7859 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 15:56:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-12 15:56:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1277. [2024-11-12 15:56:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 813 states have (on average 1.795817958179582) internal successors, (1460), 1264 states have internal predecessors, (1460), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-12 15:56:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1507 transitions. [2024-11-12 15:56:05,204 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1507 transitions. Word has length 78 [2024-11-12 15:56:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:56:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1507 transitions. [2024-11-12 15:56:05,204 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-12 15:56:05,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1507 transitions. [2024-11-12 15:56:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 15:56:05,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:56:05,205 INFO L218 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-12 15:56:05,212 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-12 15:56:05,405 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-12 15:56:05,405 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:56:05,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:56:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash -406516314, now seen corresponding path program 3 times [2024-11-12 15:56:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:56:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378623158] [2024-11-12 15:56:05,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 15:56:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:56:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:56:05,407 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-12 15:56:05,408 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-12 15:56:05,986 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-12 15:56:05,986 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:56:05,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 15:56:05,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:56:06,088 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-12 15:56:06,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:56:06,419 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-12 15:56:06,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:56:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378623158] [2024-11-12 15:56:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378623158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:56:06,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:56:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 15:56:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032170192] [2024-11-12 15:56:06,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:56:06,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 15:56:06,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:56:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 15:56:06,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 15:56:06,421 INFO L87 Difference]: Start difference. First operand 1277 states and 1507 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-12 15:56:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:56:07,496 INFO L93 Difference]: Finished difference Result 1301 states and 1546 transitions. [2024-11-12 15:56:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 15:56:07,497 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-12 15:56:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:56:07,499 INFO L225 Difference]: With dead ends: 1301 [2024-11-12 15:56:07,499 INFO L226 Difference]: Without dead ends: 1295 [2024-11-12 15:56:07,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 15:56:07,500 INFO L435 NwaCegarLoop]: 1126 mSDtfsCounter, 18 mSDsluCounter, 14594 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15720 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:56:07,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 15720 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 15:56:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-11-12 15:56:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2024-11-12 15:56:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 831 states have (on average 1.7845968712394704) internal successors, (1483), 1282 states have internal predecessors, (1483), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-12 15:56:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1530 transitions. [2024-11-12 15:56:07,509 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1530 transitions. Word has length 84 [2024-11-12 15:56:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:56:07,509 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 1530 transitions. [2024-11-12 15:56:07,509 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-12 15:56:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1530 transitions. [2024-11-12 15:56:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 15:56:07,510 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:56:07,510 INFO L218 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-12 15:56:07,518 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 (21)] Ended with exit code 0 [2024-11-12 15:56:07,710 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-12 15:56:07,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:56:07,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:56:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash 303922982, now seen corresponding path program 4 times [2024-11-12 15:56:07,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:56:07,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310041760] [2024-11-12 15:56:07,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 15:56:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:56:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:56:07,713 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-12 15:56:07,719 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-12 15:56:08,075 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 15:56:08,075 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:56:08,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 15:56:08,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:56:08,377 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-12 15:56:08,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:56:09,268 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-12 15:56:09,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:56:09,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310041760] [2024-11-12 15:56:09,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310041760] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 15:56:09,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 15:56:09,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 15:56:09,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230093158] [2024-11-12 15:56:09,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 15:56:09,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 15:56:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 15:56:09,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 15:56:09,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 15:56:09,270 INFO L87 Difference]: Start difference. First operand 1295 states and 1530 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-12 15:56:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 15:56:12,957 INFO L93 Difference]: Finished difference Result 1335 states and 1602 transitions. [2024-11-12 15:56:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 15:56:12,957 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-12 15:56:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 15:56:12,959 INFO L225 Difference]: With dead ends: 1335 [2024-11-12 15:56:12,959 INFO L226 Difference]: Without dead ends: 1331 [2024-11-12 15:56:12,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 15:56:12,961 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 28 mSDsluCounter, 25809 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 26934 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 15:56:12,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 26934 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 15:56:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-12 15:56:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1329. [2024-11-12 15:56:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 865 states have (on average 1.7676300578034683) internal successors, (1529), 1316 states have internal predecessors, (1529), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-12 15:56:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1576 transitions. [2024-11-12 15:56:12,971 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1576 transitions. Word has length 96 [2024-11-12 15:56:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 15:56:12,971 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1576 transitions. [2024-11-12 15:56:12,971 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-12 15:56:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1576 transitions. [2024-11-12 15:56:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 15:56:12,972 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 15:56:12,972 INFO L218 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-12 15:56:12,983 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 (22)] Forceful destruction successful, exit code 0 [2024-11-12 15:56:13,172 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-12 15:56:13,173 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-11-12 15:56:13,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 15:56:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash 517906918, now seen corresponding path program 5 times [2024-11-12 15:56:13,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 15:56:13,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569940306] [2024-11-12 15:56:13,174 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:56:13,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 15:56:13,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 15:56:13,176 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-12 15:56:13,177 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-12 15:56:14,123 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-12 15:56:14,123 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 15:56:14,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-12 15:56:14,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 15:56:14,152 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-12 15:56:14,222 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-12 15:56:14,223 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-12 15:56:14,238 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-12 15:56:14,289 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-12 15:56:14,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-12 15:56:14,884 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-12 15:56:14,916 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-12 15:56:14,939 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-12 15:56:14,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 15:56:15,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.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|))) (_ bv1 1)))) is different from false [2024-11-12 15:56:15,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 15:56:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569940306] [2024-11-12 15:56:15,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569940306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 15:56:15,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [968869293] [2024-11-12 15:56:15,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 15:56:15,179 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 15:56:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 15:56:15,180 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-12 15:56:15,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process