./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:17:21,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:17:21,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:17:21,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:17:21,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:17:21,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:17:21,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:17:21,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:17:21,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:17:21,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:17:21,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:17:21,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:17:21,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:17:21,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:17:21,781 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:17:21,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:17:21,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:17:21,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:17:21,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:17:21,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:17:21,786 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:17:21,787 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:17:21,787 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:17:21,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:17:21,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:17:21,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:17:21,788 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:17:21,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:17:21,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:17:21,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:17:21,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:17:21,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:17:21,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:17:21,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:17:21,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:17:21,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:17:21,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:17:21,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:17:21,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:17:21,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:17:21,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:17:21,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:17:21,792 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-14 19:17:22,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:17:22,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:17:22,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:17:22,082 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:17:22,082 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:17:22,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i [2024-10-14 19:17:23,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:17:23,824 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:17:23,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i [2024-10-14 19:17:23,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca31fce71/1a92e63cbdad4cfa8dc1c09ff08d5fef/FLAGaeb3e31b2 [2024-10-14 19:17:24,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca31fce71/1a92e63cbdad4cfa8dc1c09ff08d5fef [2024-10-14 19:17:24,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:17:24,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:17:24,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:24,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:17:24,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:17:24,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:24" (1/1) ... [2024-10-14 19:17:24,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bde21d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:24, skipping insertion in model container [2024-10-14 19:17:24,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:24" (1/1) ... [2024-10-14 19:17:24,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:17:24,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:24,697 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-10-14 19:17:24,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72d69601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:24, skipping insertion in model container [2024-10-14 19:17:24,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:24,699 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:17:24,701 INFO L158 Benchmark]: Toolchain (without parser) took 586.11ms. Allocated memory is still 159.4MB. Free memory was 121.8MB in the beginning and 100.1MB in the end (delta: 21.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:17:24,701 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:17:24,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.61ms. Allocated memory is still 159.4MB. Free memory was 121.8MB in the beginning and 101.1MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:17:24,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.61ms. Allocated memory is still 159.4MB. Free memory was 121.8MB in the beginning and 101.1MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 817]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:17:26,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:17:26,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:17:26,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:17:26,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:17:26,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:17:26,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:17:26,853 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:17:26,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:17:26,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:17:26,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:17:26,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:17:26,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:17:26,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:17:26,857 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:17:26,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:17:26,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:17:26,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:17:26,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:17:26,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:17:26,859 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:17:26,861 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:17:26,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:17:26,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:17:26,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:17:26,862 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:17:26,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:17:26,863 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:17:26,863 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:17:26,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:17:26,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:17:26,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:17:26,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:17:26,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:17:26,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:17:26,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:17:26,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:17:26,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:17:26,878 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:17:26,879 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:17:26,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:17:26,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:17:26,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:17:26,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:17:26,881 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:17:26,881 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-10-14 19:17:27,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:17:27,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:17:27,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:17:27,236 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:17:27,237 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:17:27,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i [2024-10-14 19:17:28,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:17:29,106 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:17:29,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test2-2.i [2024-10-14 19:17:29,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ed98698/bfdac6e4962445a8abacc2f4a86ce6ef/FLAG4df74aa7c [2024-10-14 19:17:29,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81ed98698/bfdac6e4962445a8abacc2f4a86ce6ef [2024-10-14 19:17:29,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:17:29,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:17:29,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:29,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:17:29,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:17:29,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:29" (1/1) ... [2024-10-14 19:17:29,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3730dc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:29, skipping insertion in model container [2024-10-14 19:17:29,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:29" (1/1) ... [2024-10-14 19:17:29,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:17:30,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:30,039 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:17:30,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:17:30,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:30,141 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:17:30,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:30,288 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:17:30,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30 WrapperNode [2024-10-14 19:17:30,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:30,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:17:30,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:17:30,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:17:30,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,408 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1059 [2024-10-14 19:17:30,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:17:30,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:17:30,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:17:30,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:17:30,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,501 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-14 19:17:30,502 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,502 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:17:30,594 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:17:30,594 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:17:30,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:17:30,595 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (1/1) ... [2024-10-14 19:17:30,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:17:30,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:17:30,629 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-10-14 19:17:30,634 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-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:17:30,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:17:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:17:30,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:17:30,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:17:30,670 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:17:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:17:30,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:17:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:17:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:17:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:17:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:17:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:17:30,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:17:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:17:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:17:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:17:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:17:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:17:30,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:17:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:17:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:17:30,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:17:30,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:17:30,889 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:17:30,891 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:17:30,893 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:17:30,943 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:17:30,965 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:17:34,314 INFO L? ?]: Removed 1087 outVars from TransFormulas that were not future-live. [2024-10-14 19:17:34,314 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:17:34,458 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:17:34,459 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 19:17:34,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:17:34 BoogieIcfgContainer [2024-10-14 19:17:34,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:17:34,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:17:34,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:17:34,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:17:34,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:17:29" (1/3) ... [2024-10-14 19:17:34,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d415ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:17:34, skipping insertion in model container [2024-10-14 19:17:34,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:30" (2/3) ... [2024-10-14 19:17:34,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d415ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:17:34, skipping insertion in model container [2024-10-14 19:17:34,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:17:34" (3/3) ... [2024-10-14 19:17:34,471 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test2-2.i [2024-10-14 19:17:34,487 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:17:34,488 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 525 error locations. [2024-10-14 19:17:34,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:17:34,572 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;@11b5e76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:17:34,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 525 error locations. [2024-10-14 19:17:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 957 states, 430 states have (on average 2.5069767441860464) internal successors, (1078), 952 states have internal predecessors, (1078), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:17:34,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:34,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:17:34,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:34,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:34,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1670016, now seen corresponding path program 1 times [2024-10-14 19:17:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758549432] [2024-10-14 19:17:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:34,602 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-10-14 19:17:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:34,605 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-10-14 19:17:34,606 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-10-14 19:17:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:34,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:17:34,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:34,846 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_56| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_56| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 19:17:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:34,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:34,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758549432] [2024-10-14 19:17:34,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758549432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:34,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:34,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299057879] [2024-10-14 19:17:34,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:34,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:34,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:17:34,895 INFO L87 Difference]: Start difference. First operand has 957 states, 430 states have (on average 2.5069767441860464) internal successors, (1078), 952 states have internal predecessors, (1078), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.0) 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-10-14 19:17:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:37,011 INFO L93 Difference]: Finished difference Result 1309 states and 1410 transitions. [2024-10-14 19:17:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:17:37,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) 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-10-14 19:17:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:37,030 INFO L225 Difference]: With dead ends: 1309 [2024-10-14 19:17:37,031 INFO L226 Difference]: Without dead ends: 1307 [2024-10-14 19:17:37,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:17:37,034 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 390 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1411 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:37,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1212 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 804 Invalid, 0 Unknown, 1411 Unchecked, 2.0s Time] [2024-10-14 19:17:37,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2024-10-14 19:17:37,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 946. [2024-10-14 19:17:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 425 states have (on average 2.3458823529411763) internal successors, (997), 941 states have internal predecessors, (997), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1003 transitions. [2024-10-14 19:17:37,114 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1003 transitions. Word has length 3 [2024-10-14 19:17:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:37,115 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1003 transitions. [2024-10-14 19:17:37,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) 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-10-14 19:17:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1003 transitions. [2024-10-14 19:17:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:17:37,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:37,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:17:37,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:17:37,319 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-10-14 19:17:37,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:37,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1668425, now seen corresponding path program 1 times [2024-10-14 19:17:37,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967003575] [2024-10-14 19:17:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:37,321 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-10-14 19:17:37,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:37,324 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-10-14 19:17:37,325 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-10-14 19:17:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:37,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:17:37,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:37,460 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-10-14 19:17:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:37,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:37,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:37,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967003575] [2024-10-14 19:17:37,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967003575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:37,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:37,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:17:37,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71462301] [2024-10-14 19:17:37,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:37,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:17:37,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:37,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:17:37,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:37,473 INFO L87 Difference]: Start difference. First operand 946 states and 1003 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-14 19:17:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:38,698 INFO L93 Difference]: Finished difference Result 1107 states and 1174 transitions. [2024-10-14 19:17:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:17:38,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-14 19:17:38,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:38,703 INFO L225 Difference]: With dead ends: 1107 [2024-10-14 19:17:38,703 INFO L226 Difference]: Without dead ends: 1107 [2024-10-14 19:17:38,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:38,705 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 878 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:38,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [881 Valid, 639 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:17:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2024-10-14 19:17:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 943. [2024-10-14 19:17:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 433 states have (on average 2.2979214780600463) internal successors, (995), 938 states have internal predecessors, (995), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1001 transitions. [2024-10-14 19:17:38,738 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1001 transitions. Word has length 3 [2024-10-14 19:17:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:38,738 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1001 transitions. [2024-10-14 19:17:38,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-14 19:17:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1001 transitions. [2024-10-14 19:17:38,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 19:17:38,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:38,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 19:17:38,743 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-10-14 19:17:38,939 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-10-14 19:17:38,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:38,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1668426, now seen corresponding path program 1 times [2024-10-14 19:17:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921018007] [2024-10-14 19:17:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:38,941 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-10-14 19:17:38,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:38,945 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-10-14 19:17:38,948 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-10-14 19:17:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:39,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:17:39,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:39,073 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-10-14 19:17:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:39,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:39,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921018007] [2024-10-14 19:17:39,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921018007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:39,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:17:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414592383] [2024-10-14 19:17:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:39,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:17:39,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:39,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:17:39,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:39,094 INFO L87 Difference]: Start difference. First operand 943 states and 1001 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-14 19:17:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:40,985 INFO L93 Difference]: Finished difference Result 1317 states and 1407 transitions. [2024-10-14 19:17:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:17:40,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-14 19:17:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:40,990 INFO L225 Difference]: With dead ends: 1317 [2024-10-14 19:17:40,990 INFO L226 Difference]: Without dead ends: 1317 [2024-10-14 19:17:40,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:40,992 INFO L432 NwaCegarLoop]: 737 mSDtfsCounter, 406 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:40,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1215 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 19:17:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2024-10-14 19:17:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1048. [2024-10-14 19:17:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 539 states have (on average 2.2337662337662336) internal successors, (1204), 1043 states have internal predecessors, (1204), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:41,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1210 transitions. [2024-10-14 19:17:41,017 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1210 transitions. Word has length 3 [2024-10-14 19:17:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:41,017 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1210 transitions. [2024-10-14 19:17:41,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-10-14 19:17:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1210 transitions. [2024-10-14 19:17:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:17:41,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:41,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:41,022 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-10-14 19:17:41,219 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-10-14 19:17:41,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:41,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:41,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1067389101, now seen corresponding path program 1 times [2024-10-14 19:17:41,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:41,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089482512] [2024-10-14 19:17:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:41,221 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-10-14 19:17:41,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:41,225 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-10-14 19:17:41,226 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-10-14 19:17:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:41,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:17:41,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:41,360 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-10-14 19:17:41,365 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-10-14 19:17:41,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:17:41,438 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-10-14 19:17:41,455 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:17:41,456 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-10-14 19:17:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:41,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:41,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089482512] [2024-10-14 19:17:41,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089482512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:41,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847563434] [2024-10-14 19:17:41,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:41,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:41,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:41,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:41,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:17:41,485 INFO L87 Difference]: Start difference. First operand 1048 states and 1210 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-14 19:17:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:43,198 INFO L93 Difference]: Finished difference Result 1201 states and 1371 transitions. [2024-10-14 19:17:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:17:43,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-14 19:17:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:43,203 INFO L225 Difference]: With dead ends: 1201 [2024-10-14 19:17:43,203 INFO L226 Difference]: Without dead ends: 1201 [2024-10-14 19:17:43,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:17:43,204 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 1138 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:43,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 317 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:17:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2024-10-14 19:17:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 931. [2024-10-14 19:17:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 433 states have (on average 2.2678983833718247) internal successors, (982), 926 states have internal predecessors, (982), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 988 transitions. [2024-10-14 19:17:43,225 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 988 transitions. Word has length 7 [2024-10-14 19:17:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:43,226 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 988 transitions. [2024-10-14 19:17:43,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-10-14 19:17:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 988 transitions. [2024-10-14 19:17:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 19:17:43,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:43,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:43,232 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-10-14 19:17:43,427 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-10-14 19:17:43,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:43,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1270676234, now seen corresponding path program 1 times [2024-10-14 19:17:43,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766360864] [2024-10-14 19:17:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:43,430 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-10-14 19:17:43,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:43,432 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-10-14 19:17:43,433 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-10-14 19:17:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:43,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:17:43,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:43,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-10-14 19:17:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:43,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:43,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766360864] [2024-10-14 19:17:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766360864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:43,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352659292] [2024-10-14 19:17:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:43,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:17:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:17:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:43,559 INFO L87 Difference]: Start difference. First operand 931 states and 988 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-10-14 19:17:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:44,702 INFO L93 Difference]: Finished difference Result 1076 states and 1154 transitions. [2024-10-14 19:17:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:17:44,703 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-10-14 19:17:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:44,706 INFO L225 Difference]: With dead ends: 1076 [2024-10-14 19:17:44,706 INFO L226 Difference]: Without dead ends: 1076 [2024-10-14 19:17:44,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:44,707 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 668 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:44,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 916 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:17:44,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2024-10-14 19:17:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 884. [2024-10-14 19:17:44,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 433 states have (on average 2.159353348729792) internal successors, (935), 879 states have internal predecessors, (935), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 941 transitions. [2024-10-14 19:17:44,721 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 941 transitions. Word has length 8 [2024-10-14 19:17:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:44,722 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 941 transitions. [2024-10-14 19:17:44,722 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-10-14 19:17:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 941 transitions. [2024-10-14 19:17:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 19:17:44,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:44,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:44,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:17:44,923 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-10-14 19:17:44,923 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:44,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1270676235, now seen corresponding path program 1 times [2024-10-14 19:17:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:44,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251171375] [2024-10-14 19:17:44,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:44,924 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-10-14 19:17:44,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:44,926 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-10-14 19:17:44,927 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-10-14 19:17:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:45,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:17:45,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:45,047 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-10-14 19:17:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:45,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:45,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251171375] [2024-10-14 19:17:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251171375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:45,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586301906] [2024-10-14 19:17:45,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:45,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:17:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:45,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:17:45,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:45,077 INFO L87 Difference]: Start difference. First operand 884 states and 941 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-10-14 19:17:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:46,871 INFO L93 Difference]: Finished difference Result 1139 states and 1220 transitions. [2024-10-14 19:17:46,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:17:46,872 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-10-14 19:17:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:46,876 INFO L225 Difference]: With dead ends: 1139 [2024-10-14 19:17:46,876 INFO L226 Difference]: Without dead ends: 1139 [2024-10-14 19:17:46,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:46,877 INFO L432 NwaCegarLoop]: 854 mSDtfsCounter, 447 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:46,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1195 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:17:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2024-10-14 19:17:46,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 901. [2024-10-14 19:17:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 460 states have (on average 2.15) internal successors, (989), 896 states have internal predecessors, (989), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:46,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 995 transitions. [2024-10-14 19:17:46,891 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 995 transitions. Word has length 8 [2024-10-14 19:17:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:46,892 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 995 transitions. [2024-10-14 19:17:46,892 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-10-14 19:17:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 995 transitions. [2024-10-14 19:17:46,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 19:17:46,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:46,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:46,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:17:47,093 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-10-14 19:17:47,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1957709799, now seen corresponding path program 1 times [2024-10-14 19:17:47,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:47,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845152838] [2024-10-14 19:17:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:47,096 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-10-14 19:17:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:47,099 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-10-14 19:17:47,100 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-10-14 19:17:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:47,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:17:47,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:47,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:47,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:47,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845152838] [2024-10-14 19:17:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845152838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:47,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:47,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:47,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309106150] [2024-10-14 19:17:47,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:47,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:17:47,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:47,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:17:47,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:47,254 INFO L87 Difference]: Start difference. First operand 901 states and 995 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-10-14 19:17:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:48,004 INFO L93 Difference]: Finished difference Result 1293 states and 1442 transitions. [2024-10-14 19:17:48,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:17:48,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-10-14 19:17:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:48,008 INFO L225 Difference]: With dead ends: 1293 [2024-10-14 19:17:48,008 INFO L226 Difference]: Without dead ends: 1293 [2024-10-14 19:17:48,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:48,010 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 418 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:48,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1608 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:17:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2024-10-14 19:17:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1044. [2024-10-14 19:17:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 603 states have (on average 2.074626865671642) internal successors, (1251), 1039 states have internal predecessors, (1251), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1257 transitions. [2024-10-14 19:17:48,028 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1257 transitions. Word has length 11 [2024-10-14 19:17:48,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:48,029 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1257 transitions. [2024-10-14 19:17:48,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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-10-14 19:17:48,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1257 transitions. [2024-10-14 19:17:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 19:17:48,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:48,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:48,034 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-10-14 19:17:48,233 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-10-14 19:17:48,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:48,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash -187666404, now seen corresponding path program 1 times [2024-10-14 19:17:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125986609] [2024-10-14 19:17:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:48,234 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-10-14 19:17:48,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:48,235 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-10-14 19:17:48,237 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-10-14 19:17:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:48,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:17:48,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:48,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:48,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125986609] [2024-10-14 19:17:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125986609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:48,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:48,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:17:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897320395] [2024-10-14 19:17:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:48,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:17:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:48,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:17:48,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:48,378 INFO L87 Difference]: Start difference. First operand 1044 states and 1257 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-10-14 19:17:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:48,814 INFO L93 Difference]: Finished difference Result 990 states and 1177 transitions. [2024-10-14 19:17:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:17:48,815 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-10-14 19:17:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:48,818 INFO L225 Difference]: With dead ends: 990 [2024-10-14 19:17:48,818 INFO L226 Difference]: Without dead ends: 990 [2024-10-14 19:17:48,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:48,818 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 61 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:48,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1502 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:17:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-14 19:17:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-14 19:17:48,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 573 states have (on average 2.043630017452007) internal successors, (1171), 985 states have internal predecessors, (1171), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1177 transitions. [2024-10-14 19:17:48,832 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1177 transitions. Word has length 13 [2024-10-14 19:17:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:48,832 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1177 transitions. [2024-10-14 19:17:48,832 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-10-14 19:17:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1177 transitions. [2024-10-14 19:17:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 19:17:48,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:48,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:48,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-14 19:17:49,033 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-10-14 19:17:49,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr524ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:49,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash 778833688, now seen corresponding path program 1 times [2024-10-14 19:17:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928253628] [2024-10-14 19:17:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:49,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:17:49,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:49,036 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-10-14 19:17:49,037 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-10-14 19:17:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:49,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:17:49,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:49,254 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_57| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_57| (_ bv0 1)) |c_#valid|))) is different from true [2024-10-14 19:17:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:49,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:49,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:49,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928253628] [2024-10-14 19:17:49,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928253628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:49,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:49,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:49,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884122188] [2024-10-14 19:17:49,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:49,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:49,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:49,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:49,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:17:49,257 INFO L87 Difference]: Start difference. First operand 990 states and 1177 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-14 19:17:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:50,384 INFO L93 Difference]: Finished difference Result 1238 states and 1445 transitions. [2024-10-14 19:17:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:17:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-14 19:17:50,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:50,387 INFO L225 Difference]: With dead ends: 1238 [2024-10-14 19:17:50,388 INFO L226 Difference]: Without dead ends: 1236 [2024-10-14 19:17:50,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-10-14 19:17:50,388 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 259 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1154 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:50,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1138 Invalid, 1788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 634 Invalid, 0 Unknown, 1154 Unchecked, 1.1s Time] [2024-10-14 19:17:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-10-14 19:17:50,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1049. [2024-10-14 19:17:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 632 states have (on average 2.0015822784810124) internal successors, (1265), 1044 states have internal predecessors, (1265), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1271 transitions. [2024-10-14 19:17:50,403 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1271 transitions. Word has length 14 [2024-10-14 19:17:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:50,403 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1271 transitions. [2024-10-14 19:17:50,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-14 19:17:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1271 transitions. [2024-10-14 19:17:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 19:17:50,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:50,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:50,411 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-10-14 19:17:50,605 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-10-14 19:17:50,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 778826778, now seen corresponding path program 1 times [2024-10-14 19:17:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520550361] [2024-10-14 19:17:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:50,607 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-10-14 19:17:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:50,610 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-10-14 19:17:50,612 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-10-14 19:17:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:50,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:17:50,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:50,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:50,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:50,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520550361] [2024-10-14 19:17:50,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520550361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:17:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417455877] [2024-10-14 19:17:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:50,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:17:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:17:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:17:50,786 INFO L87 Difference]: Start difference. First operand 1049 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 2.8) 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-10-14 19:17:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:52,153 INFO L93 Difference]: Finished difference Result 1286 states and 1457 transitions. [2024-10-14 19:17:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:17:52,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) 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-10-14 19:17:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:52,157 INFO L225 Difference]: With dead ends: 1286 [2024-10-14 19:17:52,157 INFO L226 Difference]: Without dead ends: 1282 [2024-10-14 19:17:52,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 19:17:52,157 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 392 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 3000 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:52,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 3000 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:17:52,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-10-14 19:17:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1047. [2024-10-14 19:17:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 630 states have (on average 2.003174603174603) internal successors, (1262), 1042 states have internal predecessors, (1262), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1268 transitions. [2024-10-14 19:17:52,172 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1268 transitions. Word has length 14 [2024-10-14 19:17:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1268 transitions. [2024-10-14 19:17:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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-10-14 19:17:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1268 transitions. [2024-10-14 19:17:52,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:17:52,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:52,172 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:52,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 19:17:52,373 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-10-14 19:17:52,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:52,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:52,374 INFO L85 PathProgramCache]: Analyzing trace with hash 41237622, now seen corresponding path program 1 times [2024-10-14 19:17:52,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:52,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042150564] [2024-10-14 19:17:52,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:52,374 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-10-14 19:17:52,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:52,375 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-10-14 19:17:52,376 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-10-14 19:17:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:52,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:17:52,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:52,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:52,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:52,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042150564] [2024-10-14 19:17:52,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042150564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:52,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:52,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:17:52,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771693640] [2024-10-14 19:17:52,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:52,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:52,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:52,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:52,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:17:52,521 INFO L87 Difference]: Start difference. First operand 1047 states and 1268 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:17:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:53,111 INFO L93 Difference]: Finished difference Result 1030 states and 1202 transitions. [2024-10-14 19:17:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:17:53,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 19:17:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:53,114 INFO L225 Difference]: With dead ends: 1030 [2024-10-14 19:17:53,114 INFO L226 Difference]: Without dead ends: 1030 [2024-10-14 19:17:53,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-10-14 19:17:53,115 INFO L432 NwaCegarLoop]: 741 mSDtfsCounter, 45 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:53,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2205 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:17:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-10-14 19:17:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2024-10-14 19:17:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 627 states have (on average 1.9074960127591707) internal successors, (1196), 1025 states have internal predecessors, (1196), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1202 transitions. [2024-10-14 19:17:53,128 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1202 transitions. Word has length 15 [2024-10-14 19:17:53,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:53,128 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1202 transitions. [2024-10-14 19:17:53,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:17:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1202 transitions. [2024-10-14 19:17:53,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 19:17:53,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:53,129 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:53,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 19:17:53,332 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-10-14 19:17:53,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:53,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1080334143, now seen corresponding path program 1 times [2024-10-14 19:17:53,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:53,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455433528] [2024-10-14 19:17:53,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:53,334 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-10-14 19:17:53,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:53,337 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-10-14 19:17:53,338 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-10-14 19:17:53,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:53,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:17:53,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:53,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:53,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:53,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455433528] [2024-10-14 19:17:53,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455433528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:53,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:53,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:17:53,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486643250] [2024-10-14 19:17:53,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:53,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:17:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:53,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:17:53,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:17:53,514 INFO L87 Difference]: Start difference. First operand 1030 states and 1202 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-14 19:17:53,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:53,904 INFO L93 Difference]: Finished difference Result 976 states and 1122 transitions. [2024-10-14 19:17:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:17:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-10-14 19:17:53,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:53,907 INFO L225 Difference]: With dead ends: 976 [2024-10-14 19:17:53,907 INFO L226 Difference]: Without dead ends: 976 [2024-10-14 19:17:53,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-10-14 19:17:53,907 INFO L432 NwaCegarLoop]: 714 mSDtfsCounter, 61 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:53,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1386 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 19:17:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-14 19:17:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-14 19:17:53,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 597 states have (on average 1.8693467336683418) internal successors, (1116), 971 states have internal predecessors, (1116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1122 transitions. [2024-10-14 19:17:53,920 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1122 transitions. Word has length 16 [2024-10-14 19:17:53,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:53,921 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1122 transitions. [2024-10-14 19:17:53,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-10-14 19:17:53,921 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1122 transitions. [2024-10-14 19:17:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 19:17:53,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:53,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:53,928 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-10-14 19:17:54,126 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-10-14 19:17:54,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:54,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1180971323, now seen corresponding path program 1 times [2024-10-14 19:17:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:54,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310991949] [2024-10-14 19:17:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:54,128 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-10-14 19:17:54,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:54,131 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-10-14 19:17:54,132 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-10-14 19:17:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:54,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:17:54,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:54,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:54,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310991949] [2024-10-14 19:17:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310991949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:17:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512407495] [2024-10-14 19:17:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:54,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:54,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:17:54,330 INFO L87 Difference]: Start difference. First operand 976 states and 1122 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-10-14 19:17:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:54,863 INFO L93 Difference]: Finished difference Result 960 states and 1078 transitions. [2024-10-14 19:17:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:17:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-10-14 19:17:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:54,866 INFO L225 Difference]: With dead ends: 960 [2024-10-14 19:17:54,866 INFO L226 Difference]: Without dead ends: 960 [2024-10-14 19:17:54,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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-10-14 19:17:54,866 INFO L432 NwaCegarLoop]: 683 mSDtfsCounter, 45 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:54,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2031 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:17:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-14 19:17:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2024-10-14 19:17:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 595 states have (on average 1.8016806722689076) internal successors, (1072), 955 states have internal predecessors, (1072), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1078 transitions. [2024-10-14 19:17:54,879 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1078 transitions. Word has length 18 [2024-10-14 19:17:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:54,881 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1078 transitions. [2024-10-14 19:17:54,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-10-14 19:17:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1078 transitions. [2024-10-14 19:17:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 19:17:54,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:54,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:54,890 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-10-14 19:17:55,087 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-10-14 19:17:55,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:55,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:55,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1386590436, now seen corresponding path program 1 times [2024-10-14 19:17:55,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:55,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781483546] [2024-10-14 19:17:55,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:55,089 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-10-14 19:17:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:55,092 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-10-14 19:17:55,094 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-10-14 19:17:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:55,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:17:55,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:55,231 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-10-14 19:17:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:55,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:55,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:55,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781483546] [2024-10-14 19:17:55,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781483546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:55,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:55,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:55,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863513465] [2024-10-14 19:17:55,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:55,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:55,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:55,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:55,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:17:55,296 INFO L87 Difference]: Start difference. First operand 960 states and 1078 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-14 19:17:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:56,446 INFO L93 Difference]: Finished difference Result 1132 states and 1251 transitions. [2024-10-14 19:17:56,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:17:56,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-14 19:17:56,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:56,449 INFO L225 Difference]: With dead ends: 1132 [2024-10-14 19:17:56,449 INFO L226 Difference]: Without dead ends: 1132 [2024-10-14 19:17:56,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10-14 19:17:56,450 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 701 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:56,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 926 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:17:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-14 19:17:56,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 956. [2024-10-14 19:17:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 595 states have (on average 1.781512605042017) internal successors, (1060), 951 states have internal predecessors, (1060), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1066 transitions. [2024-10-14 19:17:56,462 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1066 transitions. Word has length 29 [2024-10-14 19:17:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:56,462 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1066 transitions. [2024-10-14 19:17:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-14 19:17:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1066 transitions. [2024-10-14 19:17:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 19:17:56,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:56,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:56,468 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-10-14 19:17:56,663 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-10-14 19:17:56,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:56,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:56,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1386590437, now seen corresponding path program 1 times [2024-10-14 19:17:56,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:56,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844373628] [2024-10-14 19:17:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:56,665 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-10-14 19:17:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:56,666 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-10-14 19:17:56,666 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-10-14 19:17:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:56,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:17:56,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:56,805 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-10-14 19:17:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:56,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:56,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:56,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844373628] [2024-10-14 19:17:56,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844373628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:56,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:56,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:17:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316185528] [2024-10-14 19:17:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:56,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:56,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:56,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:56,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:17:56,955 INFO L87 Difference]: Start difference. First operand 956 states and 1066 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-14 19:17:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:17:58,437 INFO L93 Difference]: Finished difference Result 963 states and 1068 transitions. [2024-10-14 19:17:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:17:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-14 19:17:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:17:58,440 INFO L225 Difference]: With dead ends: 963 [2024-10-14 19:17:58,440 INFO L226 Difference]: Without dead ends: 963 [2024-10-14 19:17:58,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10-14 19:17:58,441 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 71 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:17:58,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1431 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:17:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-14 19:17:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 956. [2024-10-14 19:17:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 595 states have (on average 1.7747899159663865) internal successors, (1056), 951 states have internal predecessors, (1056), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:17:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1062 transitions. [2024-10-14 19:17:58,450 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1062 transitions. Word has length 29 [2024-10-14 19:17:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:17:58,451 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1062 transitions. [2024-10-14 19:17:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-14 19:17:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1062 transitions. [2024-10-14 19:17:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 19:17:58,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:17:58,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:17:58,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 19:17:58,654 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-10-14 19:17:58,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:17:58,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:17:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1972786551, now seen corresponding path program 1 times [2024-10-14 19:17:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:17:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062696993] [2024-10-14 19:17:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:17:58,655 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-10-14 19:17:58,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:17:58,656 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-10-14 19:17:58,658 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-10-14 19:17:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:17:58,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:17:58,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:17:58,824 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-10-14 19:17:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:17:58,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:17:58,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:17:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062696993] [2024-10-14 19:17:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062696993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:17:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:17:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:17:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104880356] [2024-10-14 19:17:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:17:58,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:17:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:17:58,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:17:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:17:58,892 INFO L87 Difference]: Start difference. First operand 956 states and 1062 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-10-14 19:18:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:00,067 INFO L93 Difference]: Finished difference Result 963 states and 1064 transitions. [2024-10-14 19:18:00,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:00,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-14 19:18:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:00,069 INFO L225 Difference]: With dead ends: 963 [2024-10-14 19:18:00,070 INFO L226 Difference]: Without dead ends: 963 [2024-10-14 19:18:00,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-10-14 19:18:00,070 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 538 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:00,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1013 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:18:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-14 19:18:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2024-10-14 19:18:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 595 states have (on average 1.761344537815126) internal successors, (1048), 947 states have internal predecessors, (1048), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1054 transitions. [2024-10-14 19:18:00,079 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1054 transitions. Word has length 32 [2024-10-14 19:18:00,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:00,079 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1054 transitions. [2024-10-14 19:18:00,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-10-14 19:18:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1054 transitions. [2024-10-14 19:18:00,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 19:18:00,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:00,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:00,086 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-10-14 19:18:00,280 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-10-14 19:18:00,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:00,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:00,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1972786550, now seen corresponding path program 1 times [2024-10-14 19:18:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030681334] [2024-10-14 19:18:00,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:00,283 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-10-14 19:18:00,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:00,284 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-10-14 19:18:00,285 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-10-14 19:18:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:00,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:18:00,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:00,436 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-10-14 19:18:00,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:00,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:00,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:00,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030681334] [2024-10-14 19:18:00,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030681334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:00,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:00,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:00,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361181105] [2024-10-14 19:18:00,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:00,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:00,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:00,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:00,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:00,559 INFO L87 Difference]: Start difference. First operand 952 states and 1054 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-10-14 19:18:02,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:02,163 INFO L93 Difference]: Finished difference Result 1191 states and 1278 transitions. [2024-10-14 19:18:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:02,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-10-14 19:18:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:02,166 INFO L225 Difference]: With dead ends: 1191 [2024-10-14 19:18:02,167 INFO L226 Difference]: Without dead ends: 1191 [2024-10-14 19:18:02,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-10-14 19:18:02,167 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 313 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:02,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1556 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 19:18:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-14 19:18:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 948. [2024-10-14 19:18:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 595 states have (on average 1.7478991596638656) internal successors, (1040), 943 states have internal predecessors, (1040), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1046 transitions. [2024-10-14 19:18:02,176 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1046 transitions. Word has length 32 [2024-10-14 19:18:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:02,176 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1046 transitions. [2024-10-14 19:18:02,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-10-14 19:18:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1046 transitions. [2024-10-14 19:18:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 19:18:02,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:02,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:02,183 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-10-14 19:18:02,378 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-10-14 19:18:02,378 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:02,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2024880475, now seen corresponding path program 1 times [2024-10-14 19:18:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:02,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801656604] [2024-10-14 19:18:02,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:02,379 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-10-14 19:18:02,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:02,381 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-10-14 19:18:02,381 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-10-14 19:18:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:02,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:02,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:02,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:02,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:02,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801656604] [2024-10-14 19:18:02,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801656604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:02,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805040307] [2024-10-14 19:18:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:02,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:02,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:02,587 INFO L87 Difference]: Start difference. First operand 948 states and 1046 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-14 19:18:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:03,100 INFO L93 Difference]: Finished difference Result 930 states and 1016 transitions. [2024-10-14 19:18:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:03,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2024-10-14 19:18:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:03,104 INFO L225 Difference]: With dead ends: 930 [2024-10-14 19:18:03,104 INFO L226 Difference]: Without dead ends: 930 [2024-10-14 19:18:03,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-10-14 19:18:03,105 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 21 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:03,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1996 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:18:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2024-10-14 19:18:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 930. [2024-10-14 19:18:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 577 states have (on average 1.7504332755632583) internal successors, (1010), 925 states have internal predecessors, (1010), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1016 transitions. [2024-10-14 19:18:03,116 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1016 transitions. Word has length 49 [2024-10-14 19:18:03,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:03,117 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1016 transitions. [2024-10-14 19:18:03,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-14 19:18:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1016 transitions. [2024-10-14 19:18:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 19:18:03,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:03,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:03,125 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-10-14 19:18:03,319 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-10-14 19:18:03,319 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:03,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -486844261, now seen corresponding path program 1 times [2024-10-14 19:18:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:03,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497420260] [2024-10-14 19:18:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:03,326 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-10-14 19:18:03,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:03,328 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-10-14 19:18:03,329 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-10-14 19:18:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:03,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:03,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:03,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:03,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:03,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497420260] [2024-10-14 19:18:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497420260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:03,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:03,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:03,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345961756] [2024-10-14 19:18:03,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:03,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:03,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:03,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:03,606 INFO L87 Difference]: Start difference. First operand 930 states and 1016 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-10-14 19:18:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:04,131 INFO L93 Difference]: Finished difference Result 918 states and 996 transitions. [2024-10-14 19:18:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:04,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2024-10-14 19:18:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:04,134 INFO L225 Difference]: With dead ends: 918 [2024-10-14 19:18:04,134 INFO L226 Difference]: Without dead ends: 918 [2024-10-14 19:18:04,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-10-14 19:18:04,134 INFO L432 NwaCegarLoop]: 669 mSDtfsCounter, 15 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:04,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1990 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:18:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-10-14 19:18:04,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2024-10-14 19:18:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 565 states have (on average 1.752212389380531) internal successors, (990), 913 states have internal predecessors, (990), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 996 transitions. [2024-10-14 19:18:04,141 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 996 transitions. Word has length 51 [2024-10-14 19:18:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:04,141 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 996 transitions. [2024-10-14 19:18:04,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-10-14 19:18:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 996 transitions. [2024-10-14 19:18:04,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 19:18:04,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:04,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:04,148 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 (20)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:04,342 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-10-14 19:18:04,343 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:04,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:04,343 INFO L85 PathProgramCache]: Analyzing trace with hash -730644507, now seen corresponding path program 1 times [2024-10-14 19:18:04,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:04,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174686640] [2024-10-14 19:18:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:04,344 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-10-14 19:18:04,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:04,345 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-10-14 19:18:04,345 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-10-14 19:18:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:04,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:18:04,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:04,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:04,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:04,543 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:04,546 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-10-14 19:18:04,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:18:04,603 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-10-14 19:18:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:04,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:04,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:04,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174686640] [2024-10-14 19:18:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174686640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:04,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:04,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 19:18:04,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090200687] [2024-10-14 19:18:04,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:04,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 19:18:04,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 19:18:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:18:04,652 INFO L87 Difference]: Start difference. First operand 918 states and 996 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-10-14 19:18:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:05,749 INFO L93 Difference]: Finished difference Result 1346 states and 1445 transitions. [2024-10-14 19:18:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:18:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-10-14 19:18:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:05,753 INFO L225 Difference]: With dead ends: 1346 [2024-10-14 19:18:05,753 INFO L226 Difference]: Without dead ends: 1343 [2024-10-14 19:18:05,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:18:05,753 INFO L432 NwaCegarLoop]: 846 mSDtfsCounter, 1079 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:05,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 3372 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 19:18:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2024-10-14 19:18:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 869. [2024-10-14 19:18:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 516 states have (on average 1.819767441860465) internal successors, (939), 864 states have internal predecessors, (939), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 945 transitions. [2024-10-14 19:18:05,765 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 945 transitions. Word has length 53 [2024-10-14 19:18:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:05,766 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 945 transitions. [2024-10-14 19:18:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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-10-14 19:18:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 945 transitions. [2024-10-14 19:18:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 19:18:05,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:05,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:05,774 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-10-14 19:18:05,967 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-10-14 19:18:05,967 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:05,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:05,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1471935975, now seen corresponding path program 1 times [2024-10-14 19:18:05,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:05,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138508481] [2024-10-14 19:18:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:05,969 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-10-14 19:18:05,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:05,970 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-10-14 19:18:05,971 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-10-14 19:18:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:06,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:18:06,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:06,222 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-10-14 19:18:06,226 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-10-14 19:18:06,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:18:06,597 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-10-14 19:18:06,609 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:18:06,609 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-10-14 19:18:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:06,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:06,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138508481] [2024-10-14 19:18:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138508481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:06,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778082168] [2024-10-14 19:18:06,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:06,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:06,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:06,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:06,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:06,622 INFO L87 Difference]: Start difference. First operand 869 states and 945 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-10-14 19:18:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:07,756 INFO L93 Difference]: Finished difference Result 831 states and 907 transitions. [2024-10-14 19:18:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:07,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-10-14 19:18:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:07,759 INFO L225 Difference]: With dead ends: 831 [2024-10-14 19:18:07,759 INFO L226 Difference]: Without dead ends: 831 [2024-10-14 19:18:07,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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-10-14 19:18:07,759 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 467 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:07,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 464 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 19:18:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-10-14 19:18:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 804. [2024-10-14 19:18:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 489 states have (on average 1.7116564417177915) internal successors, (837), 799 states have internal predecessors, (837), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 843 transitions. [2024-10-14 19:18:07,766 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 843 transitions. Word has length 55 [2024-10-14 19:18:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:07,766 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 843 transitions. [2024-10-14 19:18:07,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 4 states have internal predecessors, (55), 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-10-14 19:18:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 843 transitions. [2024-10-14 19:18:07,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:18:07,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:07,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:07,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:07,967 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-10-14 19:18:07,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:07,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1034628450, now seen corresponding path program 1 times [2024-10-14 19:18:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283243631] [2024-10-14 19:18:07,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:07,969 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-10-14 19:18:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:07,970 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-10-14 19:18:07,971 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-10-14 19:18:08,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:08,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:18:08,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:08,187 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-10-14 19:18:08,200 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-10-14 19:18:08,220 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-10-14 19:18:08,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:08,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:08,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:08,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283243631] [2024-10-14 19:18:08,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283243631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:08,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:08,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:08,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934027674] [2024-10-14 19:18:08,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:08,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:18:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:08,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:18:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:18:08,232 INFO L87 Difference]: Start difference. First operand 804 states and 843 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-10-14 19:18:09,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:09,651 INFO L93 Difference]: Finished difference Result 803 states and 842 transitions. [2024-10-14 19:18:09,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:18:09,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-14 19:18:09,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:09,655 INFO L225 Difference]: With dead ends: 803 [2024-10-14 19:18:09,655 INFO L226 Difference]: Without dead ends: 803 [2024-10-14 19:18:09,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-10-14 19:18:09,655 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 2 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:09,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1679 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 19:18:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2024-10-14 19:18:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2024-10-14 19:18:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 489 states have (on average 1.7096114519427403) internal successors, (836), 798 states have internal predecessors, (836), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 842 transitions. [2024-10-14 19:18:09,664 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 842 transitions. Word has length 59 [2024-10-14 19:18:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:09,664 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 842 transitions. [2024-10-14 19:18:09,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-10-14 19:18:09,664 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 842 transitions. [2024-10-14 19:18:09,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 19:18:09,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:09,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:09,671 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 (23)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:18:09,865 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:09,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1034628449, now seen corresponding path program 1 times [2024-10-14 19:18:09,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:09,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222911752] [2024-10-14 19:18:09,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:09,866 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-10-14 19:18:09,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:09,869 INFO L229 MonitoredProcess]: Starting monitored process 24 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-10-14 19:18:09,870 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 (24)] Waiting until timeout for monitored process [2024-10-14 19:18:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:10,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:18:10,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:10,104 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-10-14 19:18:10,116 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-10-14 19:18:10,119 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-10-14 19:18:10,153 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-10-14 19:18:10,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:10,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:10,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222911752] [2024-10-14 19:18:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222911752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878004875] [2024-10-14 19:18:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:18:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:18:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:18:10,175 INFO L87 Difference]: Start difference. First operand 803 states and 842 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-10-14 19:18:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:12,142 INFO L93 Difference]: Finished difference Result 802 states and 841 transitions. [2024-10-14 19:18:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:18:12,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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 59 [2024-10-14 19:18:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:12,146 INFO L225 Difference]: With dead ends: 802 [2024-10-14 19:18:12,146 INFO L226 Difference]: Without dead ends: 802 [2024-10-14 19:18:12,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-10-14 19:18:12,147 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 1 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:12,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1698 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 19:18:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-10-14 19:18:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2024-10-14 19:18:12,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 488 states have (on average 1.7110655737704918) internal successors, (835), 797 states have internal predecessors, (835), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:18:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 841 transitions. [2024-10-14 19:18:12,157 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 841 transitions. Word has length 59 [2024-10-14 19:18:12,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:12,157 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 841 transitions. [2024-10-14 19:18:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 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-10-14 19:18:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 841 transitions. [2024-10-14 19:18:12,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:18:12,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:12,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:12,167 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 (24)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:12,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:18:12,359 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:12,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:12,359 INFO L85 PathProgramCache]: Analyzing trace with hash -396636830, now seen corresponding path program 1 times [2024-10-14 19:18:12,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:12,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462206174] [2024-10-14 19:18:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:12,360 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-10-14 19:18:12,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:12,361 INFO L229 MonitoredProcess]: Starting monitored process 25 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-10-14 19:18:12,362 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 (25)] Waiting until timeout for monitored process [2024-10-14 19:18:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:12,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:12,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:12,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:12,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462206174] [2024-10-14 19:18:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462206174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300755194] [2024-10-14 19:18:12,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:12,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:12,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:12,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:12,622 INFO L87 Difference]: Start difference. First operand 802 states and 841 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 19:18:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:13,241 INFO L93 Difference]: Finished difference Result 804 states and 844 transitions. [2024-10-14 19:18:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-14 19:18:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:13,246 INFO L225 Difference]: With dead ends: 804 [2024-10-14 19:18:13,246 INFO L226 Difference]: Without dead ends: 804 [2024-10-14 19:18:13,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-10-14 19:18:13,247 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 0 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:13,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1926 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:18:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-14 19:18:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2024-10-14 19:18:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 489 states have (on average 1.7116564417177915) internal successors, (837), 799 states have internal predecessors, (837), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:18:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 844 transitions. [2024-10-14 19:18:13,258 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 844 transitions. Word has length 65 [2024-10-14 19:18:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:13,258 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 844 transitions. [2024-10-14 19:18:13,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 19:18:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 844 transitions. [2024-10-14 19:18:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 19:18:13,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:13,259 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:13,265 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 (25)] Ended with exit code 0 [2024-10-14 19:18:13,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:18:13,460 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:13,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash -590398351, now seen corresponding path program 1 times [2024-10-14 19:18:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:13,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453576680] [2024-10-14 19:18:13,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:13,461 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-10-14 19:18:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:13,462 INFO L229 MonitoredProcess]: Starting monitored process 26 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-10-14 19:18:13,463 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 (26)] Waiting until timeout for monitored process [2024-10-14 19:18:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:13,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:18:13,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:13,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:18:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:13,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453576680] [2024-10-14 19:18:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453576680] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:18:13,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:18:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:18:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321472281] [2024-10-14 19:18:13,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:18:13,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:18:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:13,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:18:13,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:18:13,769 INFO L87 Difference]: Start difference. First operand 804 states and 844 transitions. Second operand has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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-10-14 19:18:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:14,357 INFO L93 Difference]: Finished difference Result 813 states and 858 transitions. [2024-10-14 19:18:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:18:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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 66 [2024-10-14 19:18:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:14,360 INFO L225 Difference]: With dead ends: 813 [2024-10-14 19:18:14,360 INFO L226 Difference]: Without dead ends: 813 [2024-10-14 19:18:14,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 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-10-14 19:18:14,361 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 5 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:14,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1924 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:18:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-10-14 19:18:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 812. [2024-10-14 19:18:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 496 states have (on average 1.7137096774193548) internal successors, (850), 806 states have internal predecessors, (850), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:18:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 857 transitions. [2024-10-14 19:18:14,371 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 857 transitions. Word has length 66 [2024-10-14 19:18:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 857 transitions. [2024-10-14 19:18:14,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.166666666666666) internal successors, (67), 8 states have internal predecessors, (67), 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-10-14 19:18:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 857 transitions. [2024-10-14 19:18:14,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 19:18:14,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:14,373 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:14,383 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 (26)] Ended with exit code 0 [2024-10-14 19:18:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:18:14,574 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 558274850, now seen corresponding path program 2 times [2024-10-14 19:18:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805939433] [2024-10-14 19:18:14,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:18:14,575 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-10-14 19:18:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:14,576 INFO L229 MonitoredProcess]: Starting monitored process 27 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-10-14 19:18:14,577 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 (27)] Waiting until timeout for monitored process [2024-10-14 19:18:14,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:18:14,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:18:14,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:18:14,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:14,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:18:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:15,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:15,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805939433] [2024-10-14 19:18:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805939433] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:18:15,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:18:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:18:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651337986] [2024-10-14 19:18:15,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:18:15,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:18:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:15,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:18:15,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:18:15,089 INFO L87 Difference]: Start difference. First operand 812 states and 857 transitions. Second operand has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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-10-14 19:18:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:16,810 INFO L93 Difference]: Finished difference Result 824 states and 876 transitions. [2024-10-14 19:18:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:18:16,812 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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 69 [2024-10-14 19:18:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:16,814 INFO L225 Difference]: With dead ends: 824 [2024-10-14 19:18:16,814 INFO L226 Difference]: Without dead ends: 822 [2024-10-14 19:18:16,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 19:18:16,817 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 8 mSDsluCounter, 4484 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5126 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:16,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5126 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:18:16,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-14 19:18:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 821. [2024-10-14 19:18:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 505 states have (on average 1.706930693069307) internal successors, (862), 815 states have internal predecessors, (862), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:18:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 869 transitions. [2024-10-14 19:18:16,848 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 869 transitions. Word has length 69 [2024-10-14 19:18:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:16,848 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 869 transitions. [2024-10-14 19:18:16,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.083333333333333) internal successors, (73), 14 states have internal predecessors, (73), 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-10-14 19:18:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 869 transitions. [2024-10-14 19:18:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 19:18:16,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:16,849 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:16,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:18:17,050 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1086093630, now seen corresponding path program 3 times [2024-10-14 19:18:17,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:17,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709244166] [2024-10-14 19:18:17,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:18:17,051 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-10-14 19:18:17,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:17,052 INFO L229 MonitoredProcess]: Starting monitored process 28 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-10-14 19:18:17,053 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 (28)] Waiting until timeout for monitored process [2024-10-14 19:18:17,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:18:17,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:18:17,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:18:17,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:17,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:18:18,192 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:18,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:18,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709244166] [2024-10-14 19:18:18,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709244166] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:18:18,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:18:18,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:18:18,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288471858] [2024-10-14 19:18:18,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:18:18,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:18:18,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:18,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:18:18,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:18:18,194 INFO L87 Difference]: Start difference. First operand 821 states and 869 transitions. Second operand has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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-10-14 19:18:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:21,550 INFO L93 Difference]: Finished difference Result 842 states and 905 transitions. [2024-10-14 19:18:21,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:18:21,551 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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-10-14 19:18:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:21,553 INFO L225 Difference]: With dead ends: 842 [2024-10-14 19:18:21,553 INFO L226 Difference]: Without dead ends: 839 [2024-10-14 19:18:21,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:18:21,554 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 14 mSDsluCounter, 8328 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8970 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:21,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8970 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 19:18:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2024-10-14 19:18:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2024-10-14 19:18:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 523 states have (on average 1.6921606118546846) internal successors, (885), 833 states have internal predecessors, (885), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:18:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 892 transitions. [2024-10-14 19:18:21,565 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 892 transitions. Word has length 75 [2024-10-14 19:18:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:21,565 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 892 transitions. [2024-10-14 19:18:21,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 26 states have internal predecessors, (85), 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-10-14 19:18:21,566 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 892 transitions. [2024-10-14 19:18:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-14 19:18:21,566 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:21,567 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:21,577 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 (28)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:18:21,767 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:21,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 132463106, now seen corresponding path program 4 times [2024-10-14 19:18:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045186961] [2024-10-14 19:18:21,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:18:21,768 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-10-14 19:18:21,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:21,769 INFO L229 MonitoredProcess]: Starting monitored process 29 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-10-14 19:18:21,770 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 (29)] Waiting until timeout for monitored process [2024-10-14 19:18:22,199 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:18:22,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:18:22,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 19:18:22,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:22,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:18:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:23,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:23,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045186961] [2024-10-14 19:18:23,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045186961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:18:23,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:18:23,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:18:23,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862438019] [2024-10-14 19:18:23,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:18:23,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:18:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:23,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:18:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:18:23,873 INFO L87 Difference]: Start difference. First operand 839 states and 892 transitions. Second operand has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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-10-14 19:18:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:31,797 INFO L93 Difference]: Finished difference Result 876 states and 961 transitions. [2024-10-14 19:18:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:18:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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 87 [2024-10-14 19:18:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:31,800 INFO L225 Difference]: With dead ends: 876 [2024-10-14 19:18:31,800 INFO L226 Difference]: Without dead ends: 874 [2024-10-14 19:18:31,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:18:31,803 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 25 mSDsluCounter, 14725 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 15367 SdHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:31,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 15367 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-14 19:18:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-10-14 19:18:31,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 873. [2024-10-14 19:18:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 557 states have (on average 1.6714542190305206) internal successors, (931), 867 states have internal predecessors, (931), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:18:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 938 transitions. [2024-10-14 19:18:31,814 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 938 transitions. Word has length 87 [2024-10-14 19:18:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 938 transitions. [2024-10-14 19:18:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.2708333333333335) internal successors, (109), 50 states have internal predecessors, (109), 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-10-14 19:18:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 938 transitions. [2024-10-14 19:18:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 19:18:31,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:31,816 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:31,828 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 (29)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:32,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-10-14 19:18:32,021 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 522 more)] === [2024-10-14 19:18:32,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash 911568546, now seen corresponding path program 5 times [2024-10-14 19:18:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331054836] [2024-10-14 19:18:32,022 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:18:32,022 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-10-14 19:18:32,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:32,023 INFO L229 MonitoredProcess]: Starting monitored process 30 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-10-14 19:18:32,024 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 (30)] Waiting until timeout for monitored process [2024-10-14 19:18:33,066 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:18:33,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:18:33,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 19:18:33,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:33,097 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-10-14 19:18:33,179 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:18:33,179 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-10-14 19:18:33,199 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-10-14 19:18:33,259 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-10-14 19:18:34,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:18:34,035 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-10-14 19:18:34,071 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-10-14 19:18:34,092 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:18:34,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:18:34,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:34,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331054836] [2024-10-14 19:18:34,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331054836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:18:34,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [248956900] [2024-10-14 19:18:34,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:18:34,397 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:18:34,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:18:34,398 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:18:34,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-10-14 19:18:34,903 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:18:34,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:18:34,966 WARN L253 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 618 conjuncts are in the unsatisfiable core [2024-10-14 19:18:35,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:35,015 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-10-14 19:18:35,021 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 8 treesize of output 1 [2024-10-14 19:18:35,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-10-14 19:18:35,160 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:18:35,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:18:35,175 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-10-14 19:18:35,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 121 [2024-10-14 19:18:35,458 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 8 treesize of output 1 [2024-10-14 19:18:35,479 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 8 treesize of output 1 [2024-10-14 19:18:35,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:18:35,773 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:35,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205