./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:07:28,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:07:28,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:07:28,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:07:28,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:07:28,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:07:28,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:07:28,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:07:28,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:07:28,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:07:28,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:07:28,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:07:28,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:07:28,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:07:28,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:07:28,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:07:28,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:07:28,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:07:28,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:07:28,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:07:28,647 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:07:28,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:07:28,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:07:28,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:07:28,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:07:28,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:07:28,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:07:28,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:07:28,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:07:28,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:07:28,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:07:28,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:07:28,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:07:28,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:07:28,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:07:28,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:07:28,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:07:28,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:07:28,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:07:28,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:07:28,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:07:28,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:07:28,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-13 01:07:28,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:07:28,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:07:28,697 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:07:28,697 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:07:28,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:07:28,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:07:28,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:07:28,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:07:28,699 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:07:28,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:07:28,700 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:07:28,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:07:28,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:07:28,701 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:07:28,701 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:07:28,701 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:07:28,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:07:28,701 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:07:28,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:07:28,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:07:28,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:07:28,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:07:28,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:07:28,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:07:28,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:07:28,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:07:28,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:07:28,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2022-07-13 01:07:28,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:07:28,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:07:28,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:07:28,948 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:07:28,949 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:07:28,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-13 01:07:29,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebd6e60b/f8ba55560aaf418784455695628301aa/FLAGeb4eeadaf [2022-07-13 01:07:29,450 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:07:29,451 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-13 01:07:29,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebd6e60b/f8ba55560aaf418784455695628301aa/FLAGeb4eeadaf [2022-07-13 01:07:29,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebd6e60b/f8ba55560aaf418784455695628301aa [2022-07-13 01:07:29,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:07:29,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:07:29,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:07:29,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:07:29,493 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:07:29,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:07:29" (1/1) ... [2022-07-13 01:07:29,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb327b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:29, skipping insertion in model container [2022-07-13 01:07:29,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:07:29" (1/1) ... [2022-07-13 01:07:29,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:07:29,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:07:30,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-13 01:07:30,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:07:30,098 ERROR L326 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) [2022-07-13 01:07:30,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4eae8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:30, skipping insertion in model container [2022-07-13 01:07:30,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:07:30,099 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:07:30,101 INFO L158 Benchmark]: Toolchain (without parser) took 612.81ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 70.5MB in the beginning and 90.0MB in the end (delta: -19.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 01:07:30,101 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 102.8MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:07:30,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.76ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 70.3MB in the beginning and 90.0MB in the end (delta: -19.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 01:07:30,103 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 102.8MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.76ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 70.3MB in the beginning and 90.0MB in the end (delta: -19.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 64bit --witnessprinter.graph.data.programhash 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:07:31,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:07:31,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:07:31,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:07:31,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:07:31,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:07:31,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:07:31,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:07:31,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:07:31,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:07:31,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:07:31,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:07:31,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:07:31,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:07:31,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:07:31,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:07:31,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:07:31,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:07:31,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:07:31,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:07:31,944 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:07:31,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:07:31,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:07:31,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:07:31,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:07:31,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:07:31,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:07:31,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:07:31,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:07:31,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:07:31,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:07:31,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:07:31,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:07:31,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:07:31,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:07:31,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:07:31,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:07:31,963 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:07:31,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:07:31,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:07:31,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:07:31,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:07:31,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-07-13 01:07:31,998 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:07:31,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:07:31,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:07:31,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:07:32,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:07:32,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:07:32,001 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:07:32,001 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:07:32,001 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:07:32,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:07:32,002 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:07:32,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:07:32,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:07:32,003 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:07:32,003 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:07:32,003 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:07:32,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:07:32,004 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:07:32,004 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:07:32,004 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:07:32,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:07:32,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:07:32,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:07:32,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:07:32,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:07:32,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:07:32,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:07:32,005 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:07:32,006 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:07:32,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:07:32,006 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2022-07-13 01:07:32,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:07:32,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:07:32,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:07:32,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:07:32,351 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:07:32,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-13 01:07:32,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e0d3d36/1dd344f7d95f4c75820c9fee5f65f3e7/FLAGce50fd8a9 [2022-07-13 01:07:32,974 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:07:32,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2022-07-13 01:07:32,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e0d3d36/1dd344f7d95f4c75820c9fee5f65f3e7/FLAGce50fd8a9 [2022-07-13 01:07:33,242 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22e0d3d36/1dd344f7d95f4c75820c9fee5f65f3e7 [2022-07-13 01:07:33,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:07:33,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:07:33,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:07:33,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:07:33,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:07:33,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:07:33" (1/1) ... [2022-07-13 01:07:33,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a32a66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:33, skipping insertion in model container [2022-07-13 01:07:33,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:07:33" (1/1) ... [2022-07-13 01:07:33,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:07:33,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:07:33,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-13 01:07:33,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:07:33,904 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:07:33,916 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:07:33,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-13 01:07:33,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:07:34,003 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:07:34,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2022-07-13 01:07:34,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:07:34,133 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:07:34,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34 WrapperNode [2022-07-13 01:07:34,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:07:34,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:07:34,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:07:34,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:07:34,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,241 INFO L137 Inliner]: procedures = 352, calls = 112, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 383 [2022-07-13 01:07:34,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:07:34,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:07:34,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:07:34,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:07:34,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,329 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:07:34,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:07:34,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:07:34,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:07:34,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (1/1) ... [2022-07-13 01:07:34,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:07:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:07:34,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 01:07:34,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 01:07:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:07:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:07:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 01:07:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 01:07:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:07:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-13 01:07:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:07:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:07:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:07:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-07-13 01:07:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:07:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:07:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:07:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:07:34,758 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:07:34,759 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:07:35,666 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:07:35,673 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:07:35,673 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-13 01:07:35,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:07:35 BoogieIcfgContainer [2022-07-13 01:07:35,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:07:35,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:07:35,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:07:35,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:07:35,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:07:33" (1/3) ... [2022-07-13 01:07:35,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525c4c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:07:35, skipping insertion in model container [2022-07-13 01:07:35,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:07:34" (2/3) ... [2022-07-13 01:07:35,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525c4c7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:07:35, skipping insertion in model container [2022-07-13 01:07:35,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:07:35" (3/3) ... [2022-07-13 01:07:35,681 INFO L111 eAbstractionObserver]: Analyzing ICFG basename-1.i [2022-07-13 01:07:35,693 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:07:35,693 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-07-13 01:07:35,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:07:35,761 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b5ee71a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2032b639 [2022-07-13 01:07:35,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-07-13 01:07:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:07:35,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:35,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:07:35,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-13 01:07:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:35,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855413753] [2022-07-13 01:07:35,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:35,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:35,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:35,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:35,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-13 01:07:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:35,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:07:35,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:36,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:07:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:36,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:36,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:36,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855413753] [2022-07-13 01:07:36,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855413753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:36,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:36,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:07:36,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879701739] [2022-07-13 01:07:36,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:36,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:07:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:07:36,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:07:36,086 INFO L87 Difference]: Start difference. First operand has 243 states, 147 states have (on average 1.9319727891156462) internal successors, (284), 239 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:07:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:36,553 INFO L93 Difference]: Finished difference Result 251 states and 285 transitions. [2022-07-13 01:07:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:07:36,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:07:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:36,563 INFO L225 Difference]: With dead ends: 251 [2022-07-13 01:07:36,563 INFO L226 Difference]: Without dead ends: 249 [2022-07-13 01:07:36,565 INFO L412 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 [2022-07-13 01:07:36,568 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 239 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:36,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 207 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:07:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-13 01:07:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2022-07-13 01:07:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 142 states have (on average 1.8450704225352113) internal successors, (262), 229 states have internal predecessors, (262), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:36,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 266 transitions. [2022-07-13 01:07:36,611 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 266 transitions. Word has length 3 [2022-07-13 01:07:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:36,611 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 266 transitions. [2022-07-13 01:07:36,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:07:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 266 transitions. [2022-07-13 01:07:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:07:36,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:36,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:07:36,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 01:07:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:36,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-13 01:07:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:36,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993879939] [2022-07-13 01:07:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:36,829 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:36,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-13 01:07:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:36,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:07:36,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:36,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:07:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:36,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:36,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:36,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993879939] [2022-07-13 01:07:36,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993879939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:36,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:36,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:07:36,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90273915] [2022-07-13 01:07:36,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:36,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:07:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:07:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:07:36,979 INFO L87 Difference]: Start difference. First operand 233 states and 266 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:07:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:37,602 INFO L93 Difference]: Finished difference Result 232 states and 265 transitions. [2022-07-13 01:07:37,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:07:37,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:07:37,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:37,605 INFO L225 Difference]: With dead ends: 232 [2022-07-13 01:07:37,605 INFO L226 Difference]: Without dead ends: 232 [2022-07-13 01:07:37,605 INFO L412 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 [2022-07-13 01:07:37,606 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:37,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 432 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 01:07:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-13 01:07:37,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-13 01:07:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 228 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 265 transitions. [2022-07-13 01:07:37,628 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 265 transitions. Word has length 3 [2022-07-13 01:07:37,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:37,629 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 265 transitions. [2022-07-13 01:07:37,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:07:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 265 transitions. [2022-07-13 01:07:37,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:07:37,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:37,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:07:37,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:37,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:37,842 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-07-13 01:07:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:37,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373396779] [2022-07-13 01:07:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:37,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:37,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:37,845 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:37,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-13 01:07:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:37,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:07:37,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:37,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:07:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:38,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:38,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:38,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373396779] [2022-07-13 01:07:38,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373396779] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:38,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:38,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:07:38,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426678425] [2022-07-13 01:07:38,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:38,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:07:38,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:38,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:07:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:07:38,034 INFO L87 Difference]: Start difference. First operand 232 states and 265 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-13 01:07:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:38,675 INFO L93 Difference]: Finished difference Result 236 states and 269 transitions. [2022-07-13 01:07:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:07:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-07-13 01:07:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:38,678 INFO L225 Difference]: With dead ends: 236 [2022-07-13 01:07:38,678 INFO L226 Difference]: Without dead ends: 236 [2022-07-13 01:07:38,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:07:38,679 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 13 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:38,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 431 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 01:07:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-13 01:07:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2022-07-13 01:07:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 144 states have (on average 1.8263888888888888) internal successors, (263), 230 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 267 transitions. [2022-07-13 01:07:38,689 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 267 transitions. Word has length 6 [2022-07-13 01:07:38,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:38,690 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 267 transitions. [2022-07-13 01:07:38,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-13 01:07:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 267 transitions. [2022-07-13 01:07:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 01:07:38,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:38,691 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:38,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:38,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:38,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:38,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:38,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2022-07-13 01:07:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:38,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683062037] [2022-07-13 01:07:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:38,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:38,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:38,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:38,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 01:07:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:39,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:07:39,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:39,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:07:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:39,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:07:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:40,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:40,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683062037] [2022-07-13 01:07:40,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683062037] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:07:40,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:07:40,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-13 01:07:40,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014386127] [2022-07-13 01:07:40,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:07:40,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:07:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:40,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:07:40,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:07:40,062 INFO L87 Difference]: Start difference. First operand 234 states and 267 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-07-13 01:07:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:43,314 INFO L93 Difference]: Finished difference Result 240 states and 273 transitions. [2022-07-13 01:07:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:07:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 10 [2022-07-13 01:07:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:43,317 INFO L225 Difference]: With dead ends: 240 [2022-07-13 01:07:43,317 INFO L226 Difference]: Without dead ends: 240 [2022-07-13 01:07:43,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:07:43,318 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 19 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:43,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1120 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 01:07:43,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-13 01:07:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-07-13 01:07:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 151 states have (on average 1.781456953642384) internal successors, (269), 236 states have internal predecessors, (269), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 273 transitions. [2022-07-13 01:07:43,326 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 273 transitions. Word has length 10 [2022-07-13 01:07:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:43,326 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 273 transitions. [2022-07-13 01:07:43,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-07-13 01:07:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 273 transitions. [2022-07-13 01:07:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 01:07:43,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:43,328 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:43,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:43,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:43,536 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:43,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash -955562967, now seen corresponding path program 1 times [2022-07-13 01:07:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:43,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332329024] [2022-07-13 01:07:43,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:43,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:43,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:43,539 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:43,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 01:07:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:43,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:07:43,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:43,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:07:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:43,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:43,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332329024] [2022-07-13 01:07:43,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332329024] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:07:43,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:07:43,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-13 01:07:43,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612522802] [2022-07-13 01:07:43,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:07:43,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:07:43,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:43,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:07:43,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:07:43,809 INFO L87 Difference]: Start difference. First operand 240 states and 273 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:07:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:44,015 INFO L93 Difference]: Finished difference Result 260 states and 293 transitions. [2022-07-13 01:07:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:07:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-13 01:07:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:44,017 INFO L225 Difference]: With dead ends: 260 [2022-07-13 01:07:44,017 INFO L226 Difference]: Without dead ends: 260 [2022-07-13 01:07:44,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-13 01:07:44,018 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 24 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:44,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1564 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:07:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-13 01:07:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2022-07-13 01:07:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 171 states have (on average 1.6900584795321638) internal successors, (289), 256 states have internal predecessors, (289), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 293 transitions. [2022-07-13 01:07:44,025 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 293 transitions. Word has length 25 [2022-07-13 01:07:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:44,026 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 293 transitions. [2022-07-13 01:07:44,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:07:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 293 transitions. [2022-07-13 01:07:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 01:07:44,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:44,028 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:44,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:44,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:44,240 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:44,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash -167681350, now seen corresponding path program 2 times [2022-07-13 01:07:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:44,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863226693] [2022-07-13 01:07:44,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:07:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:44,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:44,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:44,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 01:07:44,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 01:07:44,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:07:44,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:07:44,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:44,424 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-13 01:07:44,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-13 01:07:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-13 01:07:44,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:44,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863226693] [2022-07-13 01:07:44,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863226693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:44,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:44,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:07:44,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145458016] [2022-07-13 01:07:44,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:44,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:07:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:44,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:07:44,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:07:44,457 INFO L87 Difference]: Start difference. First operand 260 states and 293 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-13 01:07:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:44,842 INFO L93 Difference]: Finished difference Result 271 states and 305 transitions. [2022-07-13 01:07:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:07:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2022-07-13 01:07:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:44,844 INFO L225 Difference]: With dead ends: 271 [2022-07-13 01:07:44,844 INFO L226 Difference]: Without dead ends: 271 [2022-07-13 01:07:44,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:07:44,845 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 224 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:44,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 210 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:07:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-13 01:07:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 255. [2022-07-13 01:07:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 171 states have (on average 1.6608187134502923) internal successors, (284), 251 states have internal predecessors, (284), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 288 transitions. [2022-07-13 01:07:44,851 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 288 transitions. Word has length 45 [2022-07-13 01:07:44,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:44,852 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 288 transitions. [2022-07-13 01:07:44,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-13 01:07:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 288 transitions. [2022-07-13 01:07:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 01:07:44,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:44,854 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:44,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:45,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:45,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash -167681349, now seen corresponding path program 1 times [2022-07-13 01:07:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:45,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261303254] [2022-07-13 01:07:45,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:45,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:45,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:45,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:45,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 01:07:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:45,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 01:07:45,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:45,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:07:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:07:45,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:45,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261303254] [2022-07-13 01:07:45,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261303254] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:07:45,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:07:45,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-13 01:07:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295930188] [2022-07-13 01:07:45,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:07:45,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 01:07:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:45,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 01:07:45,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-13 01:07:45,622 INFO L87 Difference]: Start difference. First operand 255 states and 288 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:07:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:46,052 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2022-07-13 01:07:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 01:07:46,053 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-13 01:07:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:46,054 INFO L225 Difference]: With dead ends: 263 [2022-07-13 01:07:46,054 INFO L226 Difference]: Without dead ends: 263 [2022-07-13 01:07:46,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-13 01:07:46,055 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 33 mSDsluCounter, 2598 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2862 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:46,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2862 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:07:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-13 01:07:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-13 01:07:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 259 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:46,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 296 transitions. [2022-07-13 01:07:46,061 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 296 transitions. Word has length 45 [2022-07-13 01:07:46,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:46,062 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 296 transitions. [2022-07-13 01:07:46,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:07:46,062 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 296 transitions. [2022-07-13 01:07:46,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 01:07:46,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:46,063 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:46,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:46,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:46,279 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:46,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1953485173, now seen corresponding path program 2 times [2022-07-13 01:07:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:46,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874099275] [2022-07-13 01:07:46,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:07:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:46,282 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:46,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 01:07:46,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 01:07:46,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:07:46,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:07:46,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:46,532 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-13 01:07:46,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:07:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:46,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:46,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:46,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874099275] [2022-07-13 01:07:46,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874099275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:46,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:46,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 01:07:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020658557] [2022-07-13 01:07:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:46,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:07:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:46,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:07:46,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:07:46,638 INFO L87 Difference]: Start difference. First operand 263 states and 296 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-13 01:07:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:48,062 INFO L93 Difference]: Finished difference Result 445 states and 509 transitions. [2022-07-13 01:07:48,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:07:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 53 [2022-07-13 01:07:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:48,065 INFO L225 Difference]: With dead ends: 445 [2022-07-13 01:07:48,065 INFO L226 Difference]: Without dead ends: 445 [2022-07-13 01:07:48,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:07:48,066 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 667 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:48,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 721 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 01:07:48,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2022-07-13 01:07:48,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 369. [2022-07-13 01:07:48,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 285 states have (on average 1.7228070175438597) internal successors, (491), 364 states have internal predecessors, (491), 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) [2022-07-13 01:07:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 497 transitions. [2022-07-13 01:07:48,075 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 497 transitions. Word has length 53 [2022-07-13 01:07:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:48,075 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 497 transitions. [2022-07-13 01:07:48,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-13 01:07:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 497 transitions. [2022-07-13 01:07:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-13 01:07:48,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:48,077 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:48,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:48,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:48,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash -530101490, now seen corresponding path program 1 times [2022-07-13 01:07:48,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:48,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589403763] [2022-07-13 01:07:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:48,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:48,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:48,290 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:48,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 01:07:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:48,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:07:48,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:48,734 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-13 01:07:48,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-13 01:07:49,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:07:49,071 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 01:07:49,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2022-07-13 01:07:49,092 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:07:49,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-13 01:07:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:49,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:49,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:49,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589403763] [2022-07-13 01:07:49,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589403763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:49,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:49,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:07:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550678712] [2022-07-13 01:07:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:49,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:07:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:49,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:07:49,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:07:49,210 INFO L87 Difference]: Start difference. First operand 369 states and 497 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-07-13 01:07:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:49,325 INFO L93 Difference]: Finished difference Result 370 states and 498 transitions. [2022-07-13 01:07:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:07:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 56 [2022-07-13 01:07:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:49,327 INFO L225 Difference]: With dead ends: 370 [2022-07-13 01:07:49,327 INFO L226 Difference]: Without dead ends: 370 [2022-07-13 01:07:49,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:07:49,328 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 5 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:49,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1278 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 220 Unchecked, 0.0s Time] [2022-07-13 01:07:49,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-13 01:07:49,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-07-13 01:07:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 286 states have (on average 1.7202797202797202) internal successors, (492), 365 states have internal predecessors, (492), 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) [2022-07-13 01:07:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 498 transitions. [2022-07-13 01:07:49,338 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 498 transitions. Word has length 56 [2022-07-13 01:07:49,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:49,338 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 498 transitions. [2022-07-13 01:07:49,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-07-13 01:07:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 498 transitions. [2022-07-13 01:07:49,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 01:07:49,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:49,339 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:49,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:49,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:49,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 746722395, now seen corresponding path program 1 times [2022-07-13 01:07:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:49,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267227161] [2022-07-13 01:07:49,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:49,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:49,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:49,565 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:49,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 01:07:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:49,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:07:49,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:49,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:49,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:49,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267227161] [2022-07-13 01:07:49,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267227161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:49,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:49,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:07:49,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413586332] [2022-07-13 01:07:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:49,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:07:49,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:07:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:07:49,795 INFO L87 Difference]: Start difference. First operand 370 states and 498 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-13 01:07:50,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:50,307 INFO L93 Difference]: Finished difference Result 387 states and 518 transitions. [2022-07-13 01:07:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:07:50,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 57 [2022-07-13 01:07:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:50,310 INFO L225 Difference]: With dead ends: 387 [2022-07-13 01:07:50,310 INFO L226 Difference]: Without dead ends: 387 [2022-07-13 01:07:50,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:07:50,311 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 394 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:50,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 244 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 01:07:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-07-13 01:07:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 363. [2022-07-13 01:07:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 286 states have (on average 1.6713286713286712) internal successors, (478), 358 states have internal predecessors, (478), 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) [2022-07-13 01:07:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 484 transitions. [2022-07-13 01:07:50,319 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 484 transitions. Word has length 57 [2022-07-13 01:07:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:50,319 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 484 transitions. [2022-07-13 01:07:50,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-13 01:07:50,320 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 484 transitions. [2022-07-13 01:07:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 01:07:50,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:50,320 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:50,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:50,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:50,527 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:50,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:50,528 INFO L85 PathProgramCache]: Analyzing trace with hash 746722396, now seen corresponding path program 1 times [2022-07-13 01:07:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:50,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429224663] [2022-07-13 01:07:50,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:50,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:50,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:50,537 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:50,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 01:07:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:50,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 01:07:50,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:50,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:50,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:50,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429224663] [2022-07-13 01:07:50,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429224663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:50,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:50,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:07:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125182283] [2022-07-13 01:07:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:50,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 01:07:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:50,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 01:07:50,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 01:07:50,881 INFO L87 Difference]: Start difference. First operand 363 states and 484 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-13 01:07:51,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:51,147 INFO L93 Difference]: Finished difference Result 279 states and 313 transitions. [2022-07-13 01:07:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 01:07:51,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 57 [2022-07-13 01:07:51,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:51,149 INFO L225 Difference]: With dead ends: 279 [2022-07-13 01:07:51,149 INFO L226 Difference]: Without dead ends: 279 [2022-07-13 01:07:51,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:07:51,150 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 258 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:51,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 922 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:07:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-13 01:07:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 257. [2022-07-13 01:07:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 181 states have (on average 1.580110497237569) internal successors, (286), 253 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 290 transitions. [2022-07-13 01:07:51,157 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 290 transitions. Word has length 57 [2022-07-13 01:07:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:51,157 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 290 transitions. [2022-07-13 01:07:51,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-13 01:07:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 290 transitions. [2022-07-13 01:07:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:07:51,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:51,159 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:51,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:51,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:51,371 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:51,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:51,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1673575759, now seen corresponding path program 1 times [2022-07-13 01:07:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:51,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299622361] [2022-07-13 01:07:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:51,374 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:51,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 01:07:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:51,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:07:51,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:51,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:51,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299622361] [2022-07-13 01:07:51,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299622361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:51,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:51,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:07:51,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228217017] [2022-07-13 01:07:51,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:51,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:07:51,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:07:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:07:51,665 INFO L87 Difference]: Start difference. First operand 257 states and 290 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-13 01:07:52,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:52,421 INFO L93 Difference]: Finished difference Result 275 states and 309 transitions. [2022-07-13 01:07:52,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:07:52,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 58 [2022-07-13 01:07:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:52,424 INFO L225 Difference]: With dead ends: 275 [2022-07-13 01:07:52,424 INFO L226 Difference]: Without dead ends: 275 [2022-07-13 01:07:52,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:07:52,425 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 254 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:52,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 624 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 01:07:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-13 01:07:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-07-13 01:07:52,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 193 states have (on average 1.5751295336787565) internal successors, (304), 264 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 308 transitions. [2022-07-13 01:07:52,431 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 308 transitions. Word has length 58 [2022-07-13 01:07:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:52,432 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 308 transitions. [2022-07-13 01:07:52,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-13 01:07:52,432 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 308 transitions. [2022-07-13 01:07:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:07:52,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:52,435 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:52,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:52,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:52,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:52,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:52,636 INFO L85 PathProgramCache]: Analyzing trace with hash 341240963, now seen corresponding path program 1 times [2022-07-13 01:07:52,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:52,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51265442] [2022-07-13 01:07:52,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:52,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:52,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:52,639 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:52,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 01:07:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:53,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 01:07:53,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:53,121 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-13 01:07:53,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-13 01:07:53,150 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:07:53,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-13 01:07:53,373 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 01:07:53,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 23 [2022-07-13 01:07:53,411 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:07:53,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-07-13 01:07:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:53,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:53,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:53,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51265442] [2022-07-13 01:07:53,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51265442] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:53,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:53,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:07:53,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284605071] [2022-07-13 01:07:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:53,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:07:53,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:53,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:07:53,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:07:53,669 INFO L87 Difference]: Start difference. First operand 268 states and 308 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-07-13 01:07:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:53,772 INFO L93 Difference]: Finished difference Result 268 states and 307 transitions. [2022-07-13 01:07:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:07:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2022-07-13 01:07:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:53,774 INFO L225 Difference]: With dead ends: 268 [2022-07-13 01:07:53,774 INFO L226 Difference]: Without dead ends: 268 [2022-07-13 01:07:53,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:07:53,775 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:53,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1352 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 329 Unchecked, 0.0s Time] [2022-07-13 01:07:53,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-07-13 01:07:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2022-07-13 01:07:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 193 states have (on average 1.5699481865284974) internal successors, (303), 264 states have internal predecessors, (303), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:53,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 307 transitions. [2022-07-13 01:07:53,780 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 307 transitions. Word has length 59 [2022-07-13 01:07:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:53,781 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 307 transitions. [2022-07-13 01:07:53,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-07-13 01:07:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 307 transitions. [2022-07-13 01:07:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:07:53,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:53,782 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:53,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:53,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:53,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash 341240962, now seen corresponding path program 1 times [2022-07-13 01:07:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:53,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234316831] [2022-07-13 01:07:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:53,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:53,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:53,998 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:53,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 01:07:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:54,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:07:54,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:54,444 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-13 01:07:54,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-13 01:07:54,480 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:07:54,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 [2022-07-13 01:07:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:54,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:54,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:54,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234316831] [2022-07-13 01:07:54,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234316831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:54,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:54,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:07:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770887458] [2022-07-13 01:07:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:54,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:07:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:07:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:07:54,497 INFO L87 Difference]: Start difference. First operand 268 states and 307 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-07-13 01:07:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:54,893 INFO L93 Difference]: Finished difference Result 275 states and 314 transitions. [2022-07-13 01:07:54,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:07:54,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 59 [2022-07-13 01:07:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:54,895 INFO L225 Difference]: With dead ends: 275 [2022-07-13 01:07:54,895 INFO L226 Difference]: Without dead ends: 275 [2022-07-13 01:07:54,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:07:54,896 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 210 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:54,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 354 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 01:07:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-07-13 01:07:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2022-07-13 01:07:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 198 states have (on average 1.5656565656565657) internal successors, (310), 268 states have internal predecessors, (310), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 314 transitions. [2022-07-13 01:07:54,901 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 314 transitions. Word has length 59 [2022-07-13 01:07:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:54,902 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 314 transitions. [2022-07-13 01:07:54,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-07-13 01:07:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 314 transitions. [2022-07-13 01:07:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 01:07:54,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:54,903 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:54,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:55,119 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -278071788, now seen corresponding path program 1 times [2022-07-13 01:07:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:55,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657226350] [2022-07-13 01:07:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:55,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:55,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:55,122 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:55,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-13 01:07:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:55,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:07:55,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:55,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:07:55,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-13 01:07:55,741 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-13 01:07:55,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-07-13 01:07:55,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 12 [2022-07-13 01:07:55,819 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:55,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:55,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:55,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657226350] [2022-07-13 01:07:55,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657226350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:55,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:55,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 01:07:55,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738222181] [2022-07-13 01:07:55,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:55,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:07:55,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:55,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:07:55,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:07:55,821 INFO L87 Difference]: Start difference. First operand 272 states and 314 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2022-07-13 01:07:56,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:56,674 INFO L93 Difference]: Finished difference Result 270 states and 310 transitions. [2022-07-13 01:07:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:07:56,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2022-07-13 01:07:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:56,679 INFO L225 Difference]: With dead ends: 270 [2022-07-13 01:07:56,679 INFO L226 Difference]: Without dead ends: 270 [2022-07-13 01:07:56,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-13 01:07:56,682 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 236 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:56,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1002 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 01:07:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-13 01:07:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2022-07-13 01:07:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 198 states have (on average 1.5454545454545454) internal successors, (306), 266 states have internal predecessors, (306), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 310 transitions. [2022-07-13 01:07:56,699 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 310 transitions. Word has length 62 [2022-07-13 01:07:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:56,700 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 310 transitions. [2022-07-13 01:07:56,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2022-07-13 01:07:56,700 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 310 transitions. [2022-07-13 01:07:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 01:07:56,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:56,706 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:07:56,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:56,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:56,911 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash -278071787, now seen corresponding path program 1 times [2022-07-13 01:07:56,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:56,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578667903] [2022-07-13 01:07:56,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:56,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:56,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:56,913 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:56,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-13 01:07:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:57,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 01:07:57,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:57,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-13 01:07:57,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:07:57,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-13 01:07:57,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-13 01:07:57,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 23 [2022-07-13 01:07:57,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 21 [2022-07-13 01:07:57,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 7 [2022-07-13 01:07:57,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 9 [2022-07-13 01:07:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:57,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:57,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578667903] [2022-07-13 01:07:57,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578667903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:57,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:57,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 01:07:57,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415887109] [2022-07-13 01:07:57,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:57,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 01:07:57,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:57,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 01:07:57,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:07:57,631 INFO L87 Difference]: Start difference. First operand 270 states and 310 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-07-13 01:07:58,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:07:58,864 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2022-07-13 01:07:58,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 01:07:58,865 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 62 [2022-07-13 01:07:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:07:58,866 INFO L225 Difference]: With dead ends: 269 [2022-07-13 01:07:58,866 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 01:07:58,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:07:58,867 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 233 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:07:58,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 836 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 01:07:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 01:07:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-13 01:07:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 198 states have (on average 1.5353535353535352) internal successors, (304), 265 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:07:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 308 transitions. [2022-07-13 01:07:58,872 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 308 transitions. Word has length 62 [2022-07-13 01:07:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:07:58,873 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 308 transitions. [2022-07-13 01:07:58,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-07-13 01:07:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2022-07-13 01:07:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 01:07:58,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:07:58,874 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-13 01:07:58,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-13 01:07:59,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:07:59,087 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:07:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:07:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash -450354753, now seen corresponding path program 1 times [2022-07-13 01:07:59,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:07:59,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56194399] [2022-07-13 01:07:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:07:59,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:07:59,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:07:59,090 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:07:59,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-13 01:07:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:07:59,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 01:07:59,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:07:59,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-13 01:07:59,628 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:07:59,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:07:59,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:07:59,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 34 [2022-07-13 01:07:59,844 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:07:59,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 44 [2022-07-13 01:07:59,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 13 [2022-07-13 01:07:59,947 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:07:59,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:07:59,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:07:59,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56194399] [2022-07-13 01:07:59,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56194399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:07:59,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:07:59,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 01:07:59,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736105160] [2022-07-13 01:07:59,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:07:59,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:07:59,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:07:59,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:07:59,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 01:07:59,949 INFO L87 Difference]: Start difference. First operand 269 states and 308 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-07-13 01:08:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:01,132 INFO L93 Difference]: Finished difference Result 290 states and 330 transitions. [2022-07-13 01:08:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:08:01,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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 66 [2022-07-13 01:08:01,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:01,134 INFO L225 Difference]: With dead ends: 290 [2022-07-13 01:08:01,134 INFO L226 Difference]: Without dead ends: 290 [2022-07-13 01:08:01,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-13 01:08:01,135 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 457 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:01,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 668 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 273 Invalid, 0 Unknown, 91 Unchecked, 1.0s Time] [2022-07-13 01:08:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-13 01:08:01,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2022-07-13 01:08:01,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.541062801932367) internal successors, (319), 274 states have internal predecessors, (319), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:01,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2022-07-13 01:08:01,140 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 66 [2022-07-13 01:08:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:01,140 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2022-07-13 01:08:01,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-07-13 01:08:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2022-07-13 01:08:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 01:08:01,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:01,141 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 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] [2022-07-13 01:08:01,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:01,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:01,352 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:08:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash -450354752, now seen corresponding path program 1 times [2022-07-13 01:08:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:01,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160821480] [2022-07-13 01:08:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:01,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:01,354 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:01,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 01:08:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:01,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 01:08:01,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:01,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-13 01:08:01,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:08:01,904 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:08:01,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:08:01,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:01,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-13 01:08:02,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 34 [2022-07-13 01:08:02,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 21 [2022-07-13 01:08:02,185 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:02,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 57 [2022-07-13 01:08:02,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 30 [2022-07-13 01:08:02,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 13 [2022-07-13 01:08:02,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 7 [2022-07-13 01:08:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-13 01:08:02,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:08:02,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:02,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160821480] [2022-07-13 01:08:02,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160821480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:08:02,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:08:02,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 01:08:02,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213845057] [2022-07-13 01:08:02,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:08:02,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 01:08:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:02,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 01:08:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 01:08:02,311 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2022-07-13 01:08:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:04,173 INFO L93 Difference]: Finished difference Result 290 states and 327 transitions. [2022-07-13 01:08:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:08:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 66 [2022-07-13 01:08:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:04,175 INFO L225 Difference]: With dead ends: 290 [2022-07-13 01:08:04,175 INFO L226 Difference]: Without dead ends: 290 [2022-07-13 01:08:04,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-13 01:08:04,176 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 476 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:04,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 694 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 01:08:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-13 01:08:04,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2022-07-13 01:08:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 207 states have (on average 1.5217391304347827) internal successors, (315), 274 states have internal predecessors, (315), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 319 transitions. [2022-07-13 01:08:04,181 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 319 transitions. Word has length 66 [2022-07-13 01:08:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:04,181 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 319 transitions. [2022-07-13 01:08:04,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2022-07-13 01:08:04,182 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 319 transitions. [2022-07-13 01:08:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 01:08:04,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:04,182 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:04,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:04,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:04,399 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:08:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1408765628, now seen corresponding path program 1 times [2022-07-13 01:08:04,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:04,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691205914] [2022-07-13 01:08:04,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:04,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:04,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:04,402 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:04,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-13 01:08:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:05,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 01:08:05,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:05,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-13 01:08:05,068 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:08:05,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:08:05,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:05,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 34 [2022-07-13 01:08:05,275 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:05,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 44 [2022-07-13 01:08:05,358 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:05,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 44 [2022-07-13 01:08:05,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 13 [2022-07-13 01:08:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-13 01:08:05,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:08:05,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1318) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-13 01:08:05,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1317))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:08:05,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1317))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:08:05,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1317 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1316))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1317)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1318)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-13 01:08:05,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:08:05,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2022-07-13 01:08:05,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4375 treesize of output 3232 [2022-07-13 01:08:05,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3228 treesize of output 2682 [2022-07-13 01:08:05,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2682 treesize of output 2626 [2022-07-13 01:08:05,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2626 treesize of output 2094 [2022-07-13 01:08:15,114 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-13 01:08:15,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2022-07-13 01:08:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2022-07-13 01:08:15,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:08:15,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691205914] [2022-07-13 01:08:15,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691205914] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:08:15,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:08:15,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-07-13 01:08:15,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185448695] [2022-07-13 01:08:15,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:08:15,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 01:08:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:08:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 01:08:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=163, Unknown=8, NotChecked=116, Total=342 [2022-07-13 01:08:15,124 INFO L87 Difference]: Start difference. First operand 278 states and 319 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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) [2022-07-13 01:08:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:08:17,049 INFO L93 Difference]: Finished difference Result 446 states and 515 transitions. [2022-07-13 01:08:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 01:08:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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 71 [2022-07-13 01:08:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:08:17,053 INFO L225 Difference]: With dead ends: 446 [2022-07-13 01:08:17,053 INFO L226 Difference]: Without dead ends: 446 [2022-07-13 01:08:17,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=86, Invalid=228, Unknown=8, NotChecked=140, Total=462 [2022-07-13 01:08:17,054 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 659 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2056 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2134 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:08:17,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2056 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 325 Invalid, 0 Unknown, 2134 Unchecked, 1.3s Time] [2022-07-13 01:08:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2022-07-13 01:08:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 296. [2022-07-13 01:08:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 225 states have (on average 1.5155555555555555) internal successors, (341), 292 states have internal predecessors, (341), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 01:08:17,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 345 transitions. [2022-07-13 01:08:17,061 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 345 transitions. Word has length 71 [2022-07-13 01:08:17,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:08:17,062 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 345 transitions. [2022-07-13 01:08:17,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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) [2022-07-13 01:08:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 345 transitions. [2022-07-13 01:08:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 01:08:17,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:08:17,063 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:08:17,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-13 01:08:17,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:08:17,283 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2022-07-13 01:08:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:08:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1408765627, now seen corresponding path program 1 times [2022-07-13 01:08:17,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:08:17,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377970755] [2022-07-13 01:08:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:08:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:08:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:08:17,285 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:08:17,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 01:08:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:08:17,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 01:08:17,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:08:17,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-07-13 01:08:17,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 01:08:17,988 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:08:17,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 01:08:18,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-13 01:08:18,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-07-13 01:08:18,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 34 [2022-07-13 01:08:18,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 21 [2022-07-13 01:08:18,263 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:18,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 57 [2022-07-13 01:08:18,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 30 [2022-07-13 01:08:18,489 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:08:18,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 57 [2022-07-13 01:08:18,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 30 [2022-07-13 01:08:18,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 13 [2022-07-13 01:08:18,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 7 [2022-07-13 01:08:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-13 01:08:18,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:08:20,457 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem128#1.base| v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2022-07-13 01:08:20,559 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-13 01:08:20,708 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-13 01:08:20,782 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1435)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1434) .cse0 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1434) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem126#1.base| v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse4 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv1 64)))))) is different from false [2022-07-13 01:08:20,912 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1435))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1434) .cse1 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1434) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1436)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2022-07-13 01:08:21,050 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1433 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1432 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1432)) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1435))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1433) .cse0 v_ArrVal_1434) .cse1 v_ArrVal_1436) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1437) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1436 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1433 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1432 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1435 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1434 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse6 (let ((.cse9 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1432))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1433) .cse7 v_ArrVal_1434) (select (select (store .cse8 .cse7 v_ArrVal_1435) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_1436))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9)))) (bvule (bvadd .cse5 .cse6) (bvadd .cse5 (_ bv1 64) .cse6))))) is different from false [2022-07-13 01:08:21,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:08:21,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2022-07-13 01:08:21,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 01:08:21,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2022-07-13 01:08:21,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 81375 treesize of output 68388 [2022-07-13 01:08:22,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1245093 treesize of output 1204764 [2022-07-13 01:08:26,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1204760 treesize of output 1084696 [2022-07-13 01:08:28,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1084696 treesize of output 1053336 [2022-07-13 01:08:31,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1053336 treesize of output 995992 [2022-07-13 01:08:33,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 995992 treesize of output 859765 [2022-07-13 01:08:35,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 859765 treesize of output 739701 [2022-07-13 01:08:37,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 739701 treesize of output 660832 [2022-07-13 01:09:08,957 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 946 DAG size of output: 946 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:09:23,464 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 946 DAG size of output: 946 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:09:31,142 WARN L233 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 946 DAG size of output: 946 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:09:47,173 WARN L233 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 946 DAG size of output: 946 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:11:29,128 WARN L233 SmtUtils]: Spent 5.70s on a formula simplification. DAG size of input: 946 DAG size of output: 946 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-13 01:11:35,192 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 946 DAG size of output: 946 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)