./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/uthash-2.0.2/uthash_SFH_test5-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 32bit --witnessprinter.graph.data.programhash adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:50:32,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:50:32,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:50:32,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:50:32,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:50:32,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:50:32,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:50:32,753 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:50:32,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:50:32,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:50:32,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:50:32,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:50:32,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:50:32,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:50:32,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:50:32,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:50:32,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:50:32,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:50:32,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:50:32,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:50:32,781 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:50:32,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:50:32,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:50:32,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:50:32,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:50:32,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:50:32,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:50:32,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:50:32,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:50:32,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:50:32,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:50:32,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:50:32,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:50:32,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:50:32,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:50:32,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:50:32,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:50:32,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:50:32,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:50:32,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:50:32,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:50:32,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:50:32,806 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-13 01:50:32,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:50:32,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:50:32,836 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:50:32,836 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:50:32,837 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:50:32,837 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:50:32,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:50:32,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:50:32,838 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:50:32,839 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:50:32,839 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:50:32,840 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:50:32,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:50:32,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:50:32,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:50:32,840 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:50:32,841 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:50:32,841 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:50:32,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:50:32,842 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:50:32,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:50:32,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:50:32,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:50:32,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:50:32,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:50:32,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:50:32,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:50:32,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:50:32,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:50:32,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:50:32,845 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2022-07-13 01:50:33,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:50:33,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:50:33,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:50:33,135 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:50:33,136 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:50:33,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2022-07-13 01:50:33,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dacc5ff7/ba085124ea77463a828868186f4e48c1/FLAG4a9146975 [2022-07-13 01:50:33,855 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:50:33,856 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2022-07-13 01:50:33,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dacc5ff7/ba085124ea77463a828868186f4e48c1/FLAG4a9146975 [2022-07-13 01:50:34,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dacc5ff7/ba085124ea77463a828868186f4e48c1 [2022-07-13 01:50:34,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:50:34,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:50:34,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:50:34,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:50:34,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:50:34,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:50:34" (1/1) ... [2022-07-13 01:50:34,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c4623d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:34, skipping insertion in model container [2022-07-13 01:50:34,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:50:34" (1/1) ... [2022-07-13 01:50:34,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:50:34,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:50:34,584 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/uthash-2.0.2/uthash_SFH_test5-1.i[33021,33034] [2022-07-13 01:50:34,706 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/uthash-2.0.2/uthash_SFH_test5-1.i[49681,49694] [2022-07-13 01:50:34,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:50:34,737 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:50:34,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@63bf7903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:34, skipping insertion in model container [2022-07-13 01:50:34,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:50:34,738 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:50:34,740 INFO L158 Benchmark]: Toolchain (without parser) took 559.72ms. Allocated memory is still 90.2MB. Free memory was 58.9MB in the beginning and 52.6MB in the end (delta: 6.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 01:50:34,740 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:50:34,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.42ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 52.6MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 01:50:34,742 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.19ms. Allocated memory is still 90.2MB. Free memory is still 46.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.42ms. Allocated memory is still 90.2MB. Free memory was 58.7MB in the beginning and 52.6MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: 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/uthash-2.0.2/uthash_SFH_test5-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 32bit --witnessprinter.graph.data.programhash adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:50:36,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:50:36,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:50:36,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:50:36,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:50:36,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:50:36,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:50:36,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:50:36,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:50:36,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:50:36,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:50:36,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:50:36,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:50:36,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:50:36,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:50:36,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:50:36,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:50:36,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:50:36,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:50:36,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:50:36,757 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:50:36,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:50:36,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:50:36,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:50:36,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:50:36,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:50:36,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:50:36,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:50:36,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:50:36,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:50:36,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:50:36,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:50:36,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:50:36,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:50:36,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:50:36,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:50:36,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:50:36,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:50:36,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:50:36,779 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:50:36,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:50:36,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:50:36,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-13 01:50:36,824 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:50:36,824 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:50:36,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:50:36,825 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:50:36,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:50:36,826 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:50:36,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:50:36,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:50:36,828 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:50:36,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:50:36,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:50:36,829 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:50:36,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:50:36,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:50:36,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:50:36,830 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:50:36,830 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:50:36,831 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:50:36,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:50:36,831 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:50:36,831 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:50:36,832 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:50:36,832 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:50:36,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:50:36,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:50:36,832 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:50:36,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:50:36,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:50:36,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:50:36,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:50:36,834 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:50:36,834 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:50:36,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:50:36,835 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adfc1710e761824cc0d761ee45a1724b8fd34135f47dcc82b27f8b64b97ca013 [2022-07-13 01:50:37,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:50:37,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:50:37,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:50:37,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:50:37,209 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:50:37,211 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2022-07-13 01:50:37,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea510e293/3b4a4cef009049e09467e44067fc7187/FLAGcbec71074 [2022-07-13 01:50:37,847 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:50:37,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test5-1.i [2022-07-13 01:50:37,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea510e293/3b4a4cef009049e09467e44067fc7187/FLAGcbec71074 [2022-07-13 01:50:38,166 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea510e293/3b4a4cef009049e09467e44067fc7187 [2022-07-13 01:50:38,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:50:38,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:50:38,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:50:38,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:50:38,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:50:38,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:50:38" (1/1) ... [2022-07-13 01:50:38,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409b61c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:38, skipping insertion in model container [2022-07-13 01:50:38,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:50:38" (1/1) ... [2022-07-13 01:50:38,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:50:38,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:50:38,585 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/uthash-2.0.2/uthash_SFH_test5-1.i[33021,33034] [2022-07-13 01:50:38,740 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/uthash-2.0.2/uthash_SFH_test5-1.i[49681,49694] [2022-07-13 01:50:38,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:50:38,769 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:50:38,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:50:38,819 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/uthash-2.0.2/uthash_SFH_test5-1.i[33021,33034] [2022-07-13 01:50:38,893 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/uthash-2.0.2/uthash_SFH_test5-1.i[49681,49694] [2022-07-13 01:50:38,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:50:38,912 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:50:38,946 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/uthash-2.0.2/uthash_SFH_test5-1.i[33021,33034] [2022-07-13 01:50:39,047 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/uthash-2.0.2/uthash_SFH_test5-1.i[49681,49694] [2022-07-13 01:50:39,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:50:39,094 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:50:39,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39 WrapperNode [2022-07-13 01:50:39,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:50:39,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:50:39,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:50:39,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:50:39,102 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:50:39" (1/1) ... [2022-07-13 01:50:39,143 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:50:39" (1/1) ... [2022-07-13 01:50:39,241 INFO L137 Inliner]: procedures = 180, calls = 388, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1414 [2022-07-13 01:50:39,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:50:39,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:50:39,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:50:39,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:50:39,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:50:39,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:50:39,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:50:39,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:50:39,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (1/1) ... [2022-07-13 01:50:39,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:50:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:50:39,434 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:50:39,446 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:50:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:50:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:50:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 01:50:39,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 01:50:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 01:50:39,481 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 01:50:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:50:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:50:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:50:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 01:50:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 01:50:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:50:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:50:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 01:50:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:50:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:50:39,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:50:39,770 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:50:39,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:50:39,779 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 01:50:45,976 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:50:45,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:50:46,000 INFO L299 CfgBuilder]: Removed 83 assume(true) statements. [2022-07-13 01:50:46,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:50:46 BoogieIcfgContainer [2022-07-13 01:50:46,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:50:46,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:50:46,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:50:46,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:50:46,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:50:38" (1/3) ... [2022-07-13 01:50:46,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3323bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:50:46, skipping insertion in model container [2022-07-13 01:50:46,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:50:39" (2/3) ... [2022-07-13 01:50:46,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3323bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:50:46, skipping insertion in model container [2022-07-13 01:50:46,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:50:46" (3/3) ... [2022-07-13 01:50:46,014 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test5-1.i [2022-07-13 01:50:46,028 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:50:46,028 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 729 error locations. [2022-07-13 01:50:46,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:50:46,103 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@7236c113, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@688ac733 [2022-07-13 01:50:46,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 729 error locations. [2022-07-13 01:50:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 1456 states, 719 states have (on average 2.2378303198887344) internal successors, (1609), 1447 states have internal predecessors, (1609), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:50:46,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:46,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:50:46,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:46,123 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-13 01:50:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:46,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470395750] [2022-07-13 01:50:46,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:46,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:46,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:46,136 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:50:46,137 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:50:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:46,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 01:50:46,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:46,329 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:50:46,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:46,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470395750] [2022-07-13 01:50:46,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470395750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:46,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:46,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:50:46,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791537284] [2022-07-13 01:50:46,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:46,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 01:50:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:46,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 01:50:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 01:50:46,378 INFO L87 Difference]: Start difference. First operand has 1456 states, 719 states have (on average 2.2378303198887344) internal successors, (1609), 1447 states have internal predecessors, (1609), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:50:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:50:46,475 INFO L93 Difference]: Finished difference Result 1438 states and 1521 transitions. [2022-07-13 01:50:46,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 01:50:46,477 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-07-13 01:50:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:50:46,495 INFO L225 Difference]: With dead ends: 1438 [2022-07-13 01:50:46,496 INFO L226 Difference]: Without dead ends: 1436 [2022-07-13 01:50:46,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 01:50:46,500 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:50:46,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:50:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-07-13 01:50:46,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2022-07-13 01:50:46,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 710 states have (on average 2.108450704225352) internal successors, (1497), 1427 states have internal predecessors, (1497), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 1519 transitions. [2022-07-13 01:50:46,584 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 1519 transitions. Word has length 5 [2022-07-13 01:50:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:50:46,584 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 1519 transitions. [2022-07-13 01:50:46,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:50:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 1519 transitions. [2022-07-13 01:50:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:50:46,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:46,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:50:46,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 01:50:46,794 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:50:46,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:46,795 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-13 01:50:46,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:46,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236867026] [2022-07-13 01:50:46,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:46,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:46,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:46,799 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:50:46,801 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:50:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:46,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:50:46,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:47,026 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:50:47,043 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:50:47,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:47,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:47,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236867026] [2022-07-13 01:50:47,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236867026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:47,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:47,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:50:47,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776701719] [2022-07-13 01:50:47,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:47,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:50:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:47,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:50:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:50:47,047 INFO L87 Difference]: Start difference. First operand 1436 states and 1519 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:50:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:50:49,565 INFO L93 Difference]: Finished difference Result 1692 states and 1818 transitions. [2022-07-13 01:50:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:50:49,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-07-13 01:50:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:50:49,584 INFO L225 Difference]: With dead ends: 1692 [2022-07-13 01:50:49,585 INFO L226 Difference]: Without dead ends: 1692 [2022-07-13 01:50:49,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:50:49,586 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 1369 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:50:49,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 1221 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 01:50:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-07-13 01:50:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1421. [2022-07-13 01:50:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 786 states have (on average 1.960559796437659) internal successors, (1541), 1412 states have internal predecessors, (1541), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1563 transitions. [2022-07-13 01:50:49,622 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1563 transitions. Word has length 5 [2022-07-13 01:50:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:50:49,623 INFO L495 AbstractCegarLoop]: Abstraction has 1421 states and 1563 transitions. [2022-07-13 01:50:49,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:50:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1563 transitions. [2022-07-13 01:50:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-13 01:50:49,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:49,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-13 01:50:49,632 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:50:49,827 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:50:49,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:49,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-13 01:50:49,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:49,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089203542] [2022-07-13 01:50:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:49,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:49,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:49,831 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:50:49,832 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:50:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:49,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:50:49,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:49,972 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:50:49,993 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:50:49,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:49,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:49,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089203542] [2022-07-13 01:50:49,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089203542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:49,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:49,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:50:49,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141384783] [2022-07-13 01:50:49,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:49,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:50:49,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:49,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:50:49,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:50:49,998 INFO L87 Difference]: Start difference. First operand 1421 states and 1563 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:50:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:50:53,169 INFO L93 Difference]: Finished difference Result 1943 states and 2134 transitions. [2022-07-13 01:50:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:50:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-07-13 01:50:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:50:53,177 INFO L225 Difference]: With dead ends: 1943 [2022-07-13 01:50:53,177 INFO L226 Difference]: Without dead ends: 1943 [2022-07-13 01:50:53,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:50:53,179 INFO L413 NwaCegarLoop]: 1351 mSDtfsCounter, 743 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:50:53,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1956 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 01:50:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2022-07-13 01:50:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1577. [2022-07-13 01:50:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 952 states have (on average 1.940126050420168) internal successors, (1847), 1568 states have internal predecessors, (1847), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 1869 transitions. [2022-07-13 01:50:53,233 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 1869 transitions. Word has length 5 [2022-07-13 01:50:53,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:50:53,233 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 1869 transitions. [2022-07-13 01:50:53,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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:50:53,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 1869 transitions. [2022-07-13 01:50:53,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-13 01:50:53,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:53,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-13 01:50:53,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 01:50:53,442 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:50:53,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-13 01:50:53,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:53,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521715856] [2022-07-13 01:50:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:53,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:53,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:53,446 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:50:53,448 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:50:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:53,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:50:53,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:53,576 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:50:53,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:53,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:53,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521715856] [2022-07-13 01:50:53,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521715856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:53,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:53,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:50:53,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666528419] [2022-07-13 01:50:53,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:53,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:50:53,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:53,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:50:53,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:50:53,585 INFO L87 Difference]: Start difference. First operand 1577 states and 1869 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:50:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:50:53,753 INFO L93 Difference]: Finished difference Result 3137 states and 3721 transitions. [2022-07-13 01:50:53,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:50:53,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:50:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:50:53,771 INFO L225 Difference]: With dead ends: 3137 [2022-07-13 01:50:53,772 INFO L226 Difference]: Without dead ends: 3137 [2022-07-13 01:50:53,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:50:53,773 INFO L413 NwaCegarLoop]: 1922 mSDtfsCounter, 1377 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:50:53,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 3330 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:50:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2022-07-13 01:50:53,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 1579. [2022-07-13 01:50:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 954 states have (on average 1.9381551362683438) internal successors, (1849), 1570 states have internal predecessors, (1849), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 1871 transitions. [2022-07-13 01:50:53,826 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 1871 transitions. Word has length 6 [2022-07-13 01:50:53,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:50:53,826 INFO L495 AbstractCegarLoop]: Abstraction has 1579 states and 1871 transitions. [2022-07-13 01:50:53,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:50:53,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 1871 transitions. [2022-07-13 01:50:53,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:50:53,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:53,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:50:53,843 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:50:54,041 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:50:54,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:54,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-13 01:50:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:54,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765568767] [2022-07-13 01:50:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:54,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:54,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:54,044 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:50:54,046 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:50:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:54,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:50:54,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:54,197 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:50:54,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:54,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:54,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765568767] [2022-07-13 01:50:54,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765568767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:54,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:54,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:50:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174036494] [2022-07-13 01:50:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:54,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:50:54,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:54,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:50:54,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:50:54,204 INFO L87 Difference]: Start difference. First operand 1579 states and 1871 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:50:54,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:50:54,249 INFO L93 Difference]: Finished difference Result 1543 states and 1834 transitions. [2022-07-13 01:50:54,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:50:54,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 01:50:54,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:50:54,256 INFO L225 Difference]: With dead ends: 1543 [2022-07-13 01:50:54,256 INFO L226 Difference]: Without dead ends: 1543 [2022-07-13 01:50:54,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:50:54,259 INFO L413 NwaCegarLoop]: 1370 mSDtfsCounter, 1340 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:50:54,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1398 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:50:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-07-13 01:50:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1537. [2022-07-13 01:50:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 936 states have (on average 1.9294871794871795) internal successors, (1806), 1528 states have internal predecessors, (1806), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1828 transitions. [2022-07-13 01:50:54,294 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1828 transitions. Word has length 11 [2022-07-13 01:50:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:50:54,295 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 1828 transitions. [2022-07-13 01:50:54,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:50:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1828 transitions. [2022-07-13 01:50:54,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:50:54,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:54,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:50:54,308 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:50:54,507 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:50:54,508 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-13 01:50:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:54,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145937902] [2022-07-13 01:50:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:54,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:54,512 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:50:54,514 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:50:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:54,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:50:54,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:54,692 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:50:54,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:54,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:54,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145937902] [2022-07-13 01:50:54,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145937902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:54,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:54,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:50:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574634681] [2022-07-13 01:50:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:54,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:50:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:50:54,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:50:54,696 INFO L87 Difference]: Start difference. First operand 1537 states and 1828 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:50:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:50:54,777 INFO L93 Difference]: Finished difference Result 1522 states and 1806 transitions. [2022-07-13 01:50:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:50:54,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 01:50:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:50:54,785 INFO L225 Difference]: With dead ends: 1522 [2022-07-13 01:50:54,785 INFO L226 Difference]: Without dead ends: 1522 [2022-07-13 01:50:54,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:50:54,787 INFO L413 NwaCegarLoop]: 1325 mSDtfsCounter, 1311 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:50:54,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 2671 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:50:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-07-13 01:50:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1515. [2022-07-13 01:50:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 928 states have (on average 1.9148706896551724) internal successors, (1777), 1506 states have internal predecessors, (1777), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1799 transitions. [2022-07-13 01:50:54,822 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1799 transitions. Word has length 13 [2022-07-13 01:50:54,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:50:54,822 INFO L495 AbstractCegarLoop]: Abstraction has 1515 states and 1799 transitions. [2022-07-13 01:50:54,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:50:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1799 transitions. [2022-07-13 01:50:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:50:54,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:54,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:50:54,835 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:50:55,034 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:50:55,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:55,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-13 01:50:55,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:55,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440619722] [2022-07-13 01:50:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:55,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:55,037 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:50:55,038 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:50:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:55,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:50:55,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:55,190 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:50:55,248 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:50:55,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:55,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:55,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440619722] [2022-07-13 01:50:55,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440619722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:55,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:55,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:50:55,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490162011] [2022-07-13 01:50:55,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:55,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:50:55,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:55,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:50:55,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:50:55,252 INFO L87 Difference]: Start difference. First operand 1515 states and 1799 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:50:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:50:58,488 INFO L93 Difference]: Finished difference Result 2377 states and 2689 transitions. [2022-07-13 01:50:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:50:58,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-07-13 01:50:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:50:58,497 INFO L225 Difference]: With dead ends: 2377 [2022-07-13 01:50:58,498 INFO L226 Difference]: Without dead ends: 2377 [2022-07-13 01:50:58,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:50:58,498 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 3015 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3023 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:50:58,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3023 Valid, 1552 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 01:50:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2022-07-13 01:50:58,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1511. [2022-07-13 01:50:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 928 states have (on average 1.9105603448275863) internal successors, (1773), 1502 states have internal predecessors, (1773), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:50:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1795 transitions. [2022-07-13 01:50:58,534 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1795 transitions. Word has length 27 [2022-07-13 01:50:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:50:58,535 INFO L495 AbstractCegarLoop]: Abstraction has 1511 states and 1795 transitions. [2022-07-13 01:50:58,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:50:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1795 transitions. [2022-07-13 01:50:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:50:58,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:50:58,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:50:58,556 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:50:58,754 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:50:58,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:50:58,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:50:58,755 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-13 01:50:58,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:50:58,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036408440] [2022-07-13 01:50:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:50:58,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:50:58,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:50:58,757 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:50:58,759 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:50:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:50:58,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:50:58,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:50:58,924 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:50:59,090 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:50:59,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:50:59,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:50:59,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036408440] [2022-07-13 01:50:59,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036408440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:50:59,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:50:59,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:50:59,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121234376] [2022-07-13 01:50:59,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:50:59,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:50:59,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:50:59,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:50:59,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:50:59,092 INFO L87 Difference]: Start difference. First operand 1511 states and 1795 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:51:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:02,420 INFO L93 Difference]: Finished difference Result 1880 states and 2063 transitions. [2022-07-13 01:51:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:51:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-07-13 01:51:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:02,427 INFO L225 Difference]: With dead ends: 1880 [2022-07-13 01:51:02,427 INFO L226 Difference]: Without dead ends: 1880 [2022-07-13 01:51:02,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:51:02,428 INFO L413 NwaCegarLoop]: 1064 mSDtfsCounter, 1293 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:02,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 2272 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 01:51:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-07-13 01:51:02,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1507. [2022-07-13 01:51:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 928 states have (on average 1.90625) internal successors, (1769), 1498 states have internal predecessors, (1769), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:51:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1791 transitions. [2022-07-13 01:51:02,471 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1791 transitions. Word has length 27 [2022-07-13 01:51:02,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:02,471 INFO L495 AbstractCegarLoop]: Abstraction has 1507 states and 1791 transitions. [2022-07-13 01:51:02,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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:51:02,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1791 transitions. [2022-07-13 01:51:02,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-13 01:51:02,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:02,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:02,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 01:51:02,682 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:51:02,683 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-13 01:51:02,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:02,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936585366] [2022-07-13 01:51:02,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:51:02,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:02,685 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:51:02,686 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:51:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:51:02,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:51:02,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:02,909 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:51:02,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:51:02,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:02,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936585366] [2022-07-13 01:51:02,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936585366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:51:02,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:51:02,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:51:02,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451249785] [2022-07-13 01:51:02,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:51:02,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:51:02,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:51:02,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:51:02,912 INFO L87 Difference]: Start difference. First operand 1507 states and 1791 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:51:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:02,959 INFO L93 Difference]: Finished difference Result 1507 states and 1787 transitions. [2022-07-13 01:51:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:51:02,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2022-07-13 01:51:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:02,965 INFO L225 Difference]: With dead ends: 1507 [2022-07-13 01:51:02,965 INFO L226 Difference]: Without dead ends: 1507 [2022-07-13 01:51:02,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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:51:02,966 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 1287 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:02,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2649 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:51:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2022-07-13 01:51:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1501. [2022-07-13 01:51:02,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 922 states have (on average 1.9078091106290673) internal successors, (1759), 1492 states have internal predecessors, (1759), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:51:02,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1781 transitions. [2022-07-13 01:51:02,994 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1781 transitions. Word has length 42 [2022-07-13 01:51:02,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:02,994 INFO L495 AbstractCegarLoop]: Abstraction has 1501 states and 1781 transitions. [2022-07-13 01:51:02,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:51:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1781 transitions. [2022-07-13 01:51:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 01:51:02,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:02,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:03,014 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:51:03,207 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:51:03,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-13 01:51:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:03,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057125959] [2022-07-13 01:51:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:51:03,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:03,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:03,210 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:51:03,213 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:51:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:51:03,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:51:03,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:03,586 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:51:03,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:51:03,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:03,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057125959] [2022-07-13 01:51:03,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057125959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:51:03,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:51:03,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:51:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343469465] [2022-07-13 01:51:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:51:03,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:51:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:03,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:51:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:51:03,589 INFO L87 Difference]: Start difference. First operand 1501 states and 1781 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:51:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:03,668 INFO L93 Difference]: Finished difference Result 1547 states and 1827 transitions. [2022-07-13 01:51:03,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:51:03,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2022-07-13 01:51:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:03,675 INFO L225 Difference]: With dead ends: 1547 [2022-07-13 01:51:03,675 INFO L226 Difference]: Without dead ends: 1547 [2022-07-13 01:51:03,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:51:03,676 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 67 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 2559 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:03,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 2559 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:51:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-07-13 01:51:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547. [2022-07-13 01:51:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 968 states have (on average 1.8646694214876034) internal successors, (1805), 1538 states have internal predecessors, (1805), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:51:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 1827 transitions. [2022-07-13 01:51:03,704 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 1827 transitions. Word has length 50 [2022-07-13 01:51:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:03,705 INFO L495 AbstractCegarLoop]: Abstraction has 1547 states and 1827 transitions. [2022-07-13 01:51:03,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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:51:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 1827 transitions. [2022-07-13 01:51:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 01:51:03,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:03,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:03,718 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:51:03,917 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:51:03,918 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:03,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:03,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-13 01:51:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:03,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888049580] [2022-07-13 01:51:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:51:03,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:03,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:03,932 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:51:03,935 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:51:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:51:04,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:51:04,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:04,229 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:51:04,235 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:51:04,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:51:04,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-13 01:51:04,584 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:51:04,585 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:51:04,603 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:51:04,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:51:04,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:04,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888049580] [2022-07-13 01:51:04,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888049580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:51:04,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:51:04,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:51:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316660279] [2022-07-13 01:51:04,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:51:04,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:51:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:04,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:51:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:51:04,606 INFO L87 Difference]: Start difference. First operand 1547 states and 1827 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:51:07,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:07,180 INFO L93 Difference]: Finished difference Result 1734 states and 1998 transitions. [2022-07-13 01:51:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:51:07,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-13 01:51:07,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:07,185 INFO L225 Difference]: With dead ends: 1734 [2022-07-13 01:51:07,185 INFO L226 Difference]: Without dead ends: 1734 [2022-07-13 01:51:07,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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:51:07,186 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 1571 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:07,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 617 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 01:51:07,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2022-07-13 01:51:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1297. [2022-07-13 01:51:07,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 802 states have (on average 1.7506234413965087) internal successors, (1404), 1288 states have internal predecessors, (1404), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:51:07,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1426 transitions. [2022-07-13 01:51:07,207 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1426 transitions. Word has length 53 [2022-07-13 01:51:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:07,208 INFO L495 AbstractCegarLoop]: Abstraction has 1297 states and 1426 transitions. [2022-07-13 01:51:07,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:51:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1426 transitions. [2022-07-13 01:51:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:51:07,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:07,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:07,225 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:51:07,423 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:51:07,424 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-13 01:51:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:07,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694979667] [2022-07-13 01:51:07,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:51:07,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:07,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:07,426 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:51:07,427 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:51:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:51:07,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:51:07,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:07,702 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:51:07,716 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 13 treesize of output 9 [2022-07-13 01:51:07,738 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 21 treesize of output 9 [2022-07-13 01:51:07,748 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:51:07,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:51:07,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:07,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694979667] [2022-07-13 01:51:07,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694979667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:51:07,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:51:07,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:51:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059709426] [2022-07-13 01:51:07,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:51:07,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:51:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:51:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:51:07,752 INFO L87 Difference]: Start difference. First operand 1297 states and 1426 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:51:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:10,215 INFO L93 Difference]: Finished difference Result 1296 states and 1425 transitions. [2022-07-13 01:51:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:51:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2022-07-13 01:51:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:10,219 INFO L225 Difference]: With dead ends: 1296 [2022-07-13 01:51:10,219 INFO L226 Difference]: Without dead ends: 1296 [2022-07-13 01:51:10,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:51:10,220 INFO L413 NwaCegarLoop]: 1239 mSDtfsCounter, 4 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:10,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3179 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 01:51:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2022-07-13 01:51:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2022-07-13 01:51:10,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 802 states have (on average 1.7493765586034913) internal successors, (1403), 1287 states have internal predecessors, (1403), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:51:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1425 transitions. [2022-07-13 01:51:10,239 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1425 transitions. Word has length 58 [2022-07-13 01:51:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:10,239 INFO L495 AbstractCegarLoop]: Abstraction has 1296 states and 1425 transitions. [2022-07-13 01:51:10,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:51:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1425 transitions. [2022-07-13 01:51:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 01:51:10,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:10,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:10,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-13 01:51:10,452 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:51:10,453 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-13 01:51:10,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:10,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097726770] [2022-07-13 01:51:10,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:51:10,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:10,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:10,456 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:51:10,457 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:51:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:51:10,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:51:10,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:10,696 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:51:10,715 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 13 treesize of output 9 [2022-07-13 01:51:10,724 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 13 treesize of output 9 [2022-07-13 01:51:10,774 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 21 treesize of output 9 [2022-07-13 01:51:10,778 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 19 treesize of output 7 [2022-07-13 01:51:10,795 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:51:10,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:51:10,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:10,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097726770] [2022-07-13 01:51:10,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097726770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:51:10,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:51:10,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:51:10,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581832030] [2022-07-13 01:51:10,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:51:10,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:51:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:51:10,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:51:10,797 INFO L87 Difference]: Start difference. First operand 1296 states and 1425 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:51:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:13,975 INFO L93 Difference]: Finished difference Result 1295 states and 1424 transitions. [2022-07-13 01:51:13,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:51:13,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2022-07-13 01:51:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:13,980 INFO L225 Difference]: With dead ends: 1295 [2022-07-13 01:51:13,981 INFO L226 Difference]: Without dead ends: 1295 [2022-07-13 01:51:13,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 01:51:13,981 INFO L413 NwaCegarLoop]: 1239 mSDtfsCounter, 2 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3209 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:13,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3209 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 01:51:13,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-07-13 01:51:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2022-07-13 01:51:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 801 states have (on average 1.7503121098626717) internal successors, (1402), 1286 states have internal predecessors, (1402), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-13 01:51:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1424 transitions. [2022-07-13 01:51:13,999 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1424 transitions. Word has length 58 [2022-07-13 01:51:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:14,000 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1424 transitions. [2022-07-13 01:51:14,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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:51:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1424 transitions. [2022-07-13 01:51:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 01:51:14,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:14,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:14,013 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:51:14,213 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:51:14,214 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1665547938, now seen corresponding path program 1 times [2022-07-13 01:51:14,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:14,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185425553] [2022-07-13 01:51:14,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:51:14,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:14,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:14,216 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:51:14,217 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:51:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:51:14,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:51:14,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:14,490 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:51:14,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:51:14,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:14,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185425553] [2022-07-13 01:51:14,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185425553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:51:14,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:51:14,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:51:14,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429709546] [2022-07-13 01:51:14,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:51:14,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:51:14,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:14,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:51:14,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:51:14,493 INFO L87 Difference]: Start difference. First operand 1295 states and 1424 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:51:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:14,552 INFO L93 Difference]: Finished difference Result 1298 states and 1429 transitions. [2022-07-13 01:51:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:51:14,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:51:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:14,566 INFO L225 Difference]: With dead ends: 1298 [2022-07-13 01:51:14,570 INFO L226 Difference]: Without dead ends: 1298 [2022-07-13 01:51:14,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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:51:14,571 INFO L413 NwaCegarLoop]: 1238 mSDtfsCounter, 2 mSDsluCounter, 2468 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3706 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:14,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3706 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:51:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2022-07-13 01:51:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2022-07-13 01:51:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 803 states have (on average 1.7496886674968868) internal successors, (1405), 1289 states have internal predecessors, (1405), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-13 01:51:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 1429 transitions. [2022-07-13 01:51:14,601 INFO L78 Accepts]: Start accepts. Automaton has 1298 states and 1429 transitions. Word has length 66 [2022-07-13 01:51:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:14,601 INFO L495 AbstractCegarLoop]: Abstraction has 1298 states and 1429 transitions. [2022-07-13 01:51:14,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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:51:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1298 states and 1429 transitions. [2022-07-13 01:51:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:51:14,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:14,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:14,619 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:51:14,816 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:51:14,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:14,817 INFO L85 PathProgramCache]: Analyzing trace with hash 382130565, now seen corresponding path program 1 times [2022-07-13 01:51:14,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:14,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449385415] [2022-07-13 01:51:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:51:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:14,819 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:51:14,822 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:51:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:51:15,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:51:15,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:15,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:51:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:15,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:15,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449385415] [2022-07-13 01:51:15,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449385415] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:51:15,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:51:15,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 01:51:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272653338] [2022-07-13 01:51:15,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:51:15,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:51:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:15,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:51:15,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:51:15,188 INFO L87 Difference]: Start difference. First operand 1298 states and 1429 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:15,343 INFO L93 Difference]: Finished difference Result 1310 states and 1447 transitions. [2022-07-13 01:51:15,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:51:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-13 01:51:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:15,347 INFO L225 Difference]: With dead ends: 1310 [2022-07-13 01:51:15,347 INFO L226 Difference]: Without dead ends: 1310 [2022-07-13 01:51:15,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-13 01:51:15,348 INFO L413 NwaCegarLoop]: 1238 mSDtfsCounter, 18 mSDsluCounter, 3699 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4937 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:15,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4937 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:51:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-07-13 01:51:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1308. [2022-07-13 01:51:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 812 states have (on average 1.748768472906404) internal successors, (1420), 1298 states have internal predecessors, (1420), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-13 01:51:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1444 transitions. [2022-07-13 01:51:15,368 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1444 transitions. Word has length 67 [2022-07-13 01:51:15,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:15,369 INFO L495 AbstractCegarLoop]: Abstraction has 1308 states and 1444 transitions. [2022-07-13 01:51:15,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1444 transitions. [2022-07-13 01:51:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-13 01:51:15,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:15,370 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:15,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-13 01:51:15,582 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:51:15,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:15,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1129452318, now seen corresponding path program 2 times [2022-07-13 01:51:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:15,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458065223] [2022-07-13 01:51:15,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:51:15,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:15,585 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:51:15,585 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:51:16,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:51:16,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:51:16,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:51:16,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:16,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:51:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:16,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:16,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458065223] [2022-07-13 01:51:16,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458065223] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:51:16,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:51:16,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 01:51:16,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451321745] [2022-07-13 01:51:16,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:51:16,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:51:16,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:16,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:51:16,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:51:16,277 INFO L87 Difference]: Start difference. First operand 1308 states and 1444 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:16,822 INFO L93 Difference]: Finished difference Result 1329 states and 1476 transitions. [2022-07-13 01:51:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 01:51:16,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-13 01:51:16,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:16,826 INFO L225 Difference]: With dead ends: 1329 [2022-07-13 01:51:16,827 INFO L226 Difference]: Without dead ends: 1325 [2022-07-13 01:51:16,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-13 01:51:16,827 INFO L413 NwaCegarLoop]: 1241 mSDtfsCounter, 56 mSDsluCounter, 6184 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 7425 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:16,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 7425 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:51:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2022-07-13 01:51:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1317. [2022-07-13 01:51:16,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 821 states have (on average 1.7442143727161998) internal successors, (1432), 1307 states have internal predecessors, (1432), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-13 01:51:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1456 transitions. [2022-07-13 01:51:16,847 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1456 transitions. Word has length 70 [2022-07-13 01:51:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:16,847 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1456 transitions. [2022-07-13 01:51:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1456 transitions. [2022-07-13 01:51:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 01:51:16,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:16,848 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:16,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-13 01:51:17,063 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:51:17,063 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:17,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:17,064 INFO L85 PathProgramCache]: Analyzing trace with hash 439069118, now seen corresponding path program 3 times [2022-07-13 01:51:17,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:17,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796646493] [2022-07-13 01:51:17,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:51:17,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:17,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:17,065 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:51:17,067 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:51:17,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 01:51:17,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:51:17,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:51:17,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:17,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:51:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:18,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:18,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796646493] [2022-07-13 01:51:18,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796646493] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:51:18,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:51:18,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-13 01:51:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737816941] [2022-07-13 01:51:18,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:51:18,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 01:51:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 01:51:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 01:51:18,490 INFO L87 Difference]: Start difference. First operand 1317 states and 1456 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:21,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:21,364 INFO L93 Difference]: Finished difference Result 1359 states and 1532 transitions. [2022-07-13 01:51:21,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 01:51:21,365 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-13 01:51:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:21,368 INFO L225 Difference]: With dead ends: 1359 [2022-07-13 01:51:21,369 INFO L226 Difference]: Without dead ends: 1353 [2022-07-13 01:51:21,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 01:51:21,370 INFO L413 NwaCegarLoop]: 1245 mSDtfsCounter, 170 mSDsluCounter, 16089 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 17334 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:21,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 17334 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 01:51:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2022-07-13 01:51:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1335. [2022-07-13 01:51:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 839 states have (on average 1.7342073897497021) internal successors, (1455), 1325 states have internal predecessors, (1455), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-13 01:51:21,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1479 transitions. [2022-07-13 01:51:21,393 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1479 transitions. Word has length 76 [2022-07-13 01:51:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:21,393 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1479 transitions. [2022-07-13 01:51:21,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1479 transitions. [2022-07-13 01:51:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 01:51:21,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:21,395 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:21,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-13 01:51:21,610 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:51:21,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:21,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -772903170, now seen corresponding path program 4 times [2022-07-13 01:51:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:21,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659144189] [2022-07-13 01:51:21,612 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 01:51:21,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:21,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:21,613 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:51:21,614 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:51:21,943 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 01:51:21,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:51:21,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:51:21,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:22,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:51:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:51:23,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:23,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659144189] [2022-07-13 01:51:23,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659144189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:51:23,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:51:23,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-13 01:51:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367839986] [2022-07-13 01:51:23,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:51:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 01:51:23,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:51:23,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 01:51:23,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 01:51:23,663 INFO L87 Difference]: Start difference. First operand 1335 states and 1479 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:51:35,727 INFO L93 Difference]: Finished difference Result 1415 states and 1612 transitions. [2022-07-13 01:51:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-13 01:51:35,728 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-13 01:51:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:51:35,732 INFO L225 Difference]: With dead ends: 1415 [2022-07-13 01:51:35,732 INFO L226 Difference]: Without dead ends: 1411 [2022-07-13 01:51:35,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-13 01:51:35,736 INFO L413 NwaCegarLoop]: 1258 mSDtfsCounter, 391 mSDsluCounter, 30053 mSDsCounter, 0 mSdLazyCounter, 3028 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 31311 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 3028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:51:35,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 31311 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 3028 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-13 01:51:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2022-07-13 01:51:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1369. [2022-07-13 01:51:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 873 states have (on average 1.7193585337915236) internal successors, (1501), 1359 states have internal predecessors, (1501), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-13 01:51:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1525 transitions. [2022-07-13 01:51:35,761 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1525 transitions. Word has length 88 [2022-07-13 01:51:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:51:35,761 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 1525 transitions. [2022-07-13 01:51:35,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:51:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1525 transitions. [2022-07-13 01:51:35,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 01:51:35,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:51:35,763 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:51:35,776 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:51:35,975 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:51:35,976 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:51:35,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:51:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1270031518, now seen corresponding path program 5 times [2022-07-13 01:51:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:51:35,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974812599] [2022-07-13 01:51:35,977 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:51:35,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:51:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:51:35,978 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:51:35,980 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:51:37,174 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:51:37,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:51:37,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 01:51:37,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:51:37,230 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:51:37,308 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:51:37,309 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 17 treesize of output 24 [2022-07-13 01:51:37,332 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 13 treesize of output 9 [2022-07-13 01:51:37,396 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 22 treesize of output 10 [2022-07-13 01:51:37,684 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1607)))) is different from true [2022-07-13 01:51:37,697 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1608)))) is different from true [2022-07-13 01:51:38,107 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1622)))) is different from true [2022-07-13 01:51:38,456 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1634) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:51:38,470 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1635)))) is different from true [2022-07-13 01:51:38,603 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1640)))) is different from true [2022-07-13 01:51:38,617 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1641) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:51:38,719 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:51:38,719 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 34 treesize of output 35 [2022-07-13 01:51:38,757 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 31 treesize of output 13 [2022-07-13 01:51:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 666 trivial. 287 not checked. [2022-07-13 01:51:38,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:51:39,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-13 01:51:39,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:51:39,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974812599] [2022-07-13 01:51:39,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974812599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:51:39,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421078823] [2022-07-13 01:51:39,014 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:51:39,014 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:51:39,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:51:39,021 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:51:39,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-13 01:53:13,299 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:53:13,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:53:13,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-13 01:53:13,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:53:13,553 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:53:13,624 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:53:13,624 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 17 treesize of output 24 [2022-07-13 01:53:13,634 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 13 treesize of output 9 [2022-07-13 01:53:13,685 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 22 treesize of output 10 [2022-07-13 01:53:14,042 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2059)))) is different from true [2022-07-13 01:53:14,319 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2070) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:14,510 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2077)))) is different from true [2022-07-13 01:53:14,523 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2078)))) is different from true [2022-07-13 01:53:14,562 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2080)))) is different from true [2022-07-13 01:53:14,631 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_2083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2083) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:14,897 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:53:14,897 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 34 treesize of output 35 [2022-07-13 01:53:14,924 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 31 treesize of output 13 [2022-07-13 01:53:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 703 trivial. 249 not checked. [2022-07-13 01:53:14,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:53:15,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1421078823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:53:15,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:53:15,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2022-07-13 01:53:15,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938883280] [2022-07-13 01:53:15,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:53:15,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 01:53:15,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:53:15,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 01:53:15,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=107, Unknown=24, NotChecked=462, Total=650 [2022-07-13 01:53:15,207 INFO L87 Difference]: Start difference. First operand 1369 states and 1525 transitions. Second operand has 22 states, 20 states have (on average 4.4) internal successors, (88), 22 states have internal predecessors, (88), 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:53:15,421 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1607))) (exists ((v_ArrVal_1640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1640))) (exists ((v_ArrVal_2070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2070) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2059))) (exists ((v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1622))) (exists ((v_ArrVal_2080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2080))) (exists ((v_ArrVal_2077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2077)))) is different from true [2022-07-13 01:53:15,430 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1600) |c_#memory_$Pointer$.base|)) (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (select |c_#valid| v_arrayElimCell_9) (_ bv1 1)) (not (= v_arrayElimCell_9 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)))) (exists ((v_ArrVal_1607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1607))) (exists ((v_ArrVal_2078 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2078))) (exists ((v_ArrVal_1640 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1640))) (exists ((v_ArrVal_2070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2070) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2083 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2083) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2059 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2059))) (exists ((v_ArrVal_1608 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1608))) (exists ((v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1634) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1622))) (exists ((v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1635))) (exists ((v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1641) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2080 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2080))) (exists ((v_ArrVal_2077 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2077)))) is different from true [2022-07-13 01:53:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:53:19,327 INFO L93 Difference]: Finished difference Result 1692 states and 1835 transitions. [2022-07-13 01:53:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 01:53:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 4.4) internal successors, (88), 22 states have internal predecessors, (88), 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 110 [2022-07-13 01:53:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:53:19,337 INFO L225 Difference]: With dead ends: 1692 [2022-07-13 01:53:19,337 INFO L226 Difference]: Without dead ends: 1688 [2022-07-13 01:53:19,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 124 SyntacticMatches, 78 SemanticMatches, 28 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=144, Unknown=28, NotChecked=624, Total=870 [2022-07-13 01:53:19,338 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 1140 mSDsluCounter, 3636 mSDsCounter, 0 mSdLazyCounter, 2561 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 4297 SdHoareTripleChecker+Invalid, 26691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24118 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:53:19,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 4297 Invalid, 26691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2561 Invalid, 0 Unknown, 24118 Unchecked, 3.9s Time] [2022-07-13 01:53:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2022-07-13 01:53:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1417. [2022-07-13 01:53:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 921 states have (on average 1.6818675352877308) internal successors, (1549), 1406 states have internal predecessors, (1549), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2022-07-13 01:53:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1573 transitions. [2022-07-13 01:53:19,364 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1573 transitions. Word has length 110 [2022-07-13 01:53:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:53:19,364 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1573 transitions. [2022-07-13 01:53:19,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 4.4) internal successors, (88), 22 states have internal predecessors, (88), 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:53:19,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1573 transitions. [2022-07-13 01:53:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-13 01:53:19,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:53:19,365 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:53:19,391 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:53:19,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-13 01:53:19,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-13 01:53:19,779 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 726 more)] === [2022-07-13 01:53:19,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:53:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1270031519, now seen corresponding path program 1 times [2022-07-13 01:53:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:53:19,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212653493] [2022-07-13 01:53:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:53:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:53:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:53:19,781 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:53:19,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-13 01:53:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:53:20,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-13 01:53:20,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:53:20,624 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:53:20,696 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:53:20,696 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:53:20,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-07-13 01:53:20,717 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 13 treesize of output 9 [2022-07-13 01:53:20,725 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 13 treesize of output 9 [2022-07-13 01:53:20,787 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 22 treesize of output 10 [2022-07-13 01:53:20,792 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 9 treesize of output 3 [2022-07-13 01:53:20,835 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:20,845 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-13 01:53:20,855 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-13 01:53:20,897 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:20,907 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:53:20,942 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512)))) is different from true [2022-07-13 01:53:20,952 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:20,962 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:20,972 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-13 01:53:20,981 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-13 01:53:20,990 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,017 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:21,026 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:21,064 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,074 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-13 01:53:21,084 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-07-13 01:53:21,094 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:53:21,104 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:53:21,115 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,126 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:53:21,137 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,148 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:21,158 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:21,168 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2553))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552)))) is different from true [2022-07-13 01:53:21,203 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2557))) (exists ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2556) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:53:21,213 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2559))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2558)))) is different from true [2022-07-13 01:53:21,243 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2561) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2560 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2560) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,330 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2569))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32))) (exists ((v_ArrVal_2568 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2568)))) is different from true [2022-07-13 01:53:21,340 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2570 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2570) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2571 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2571))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,428 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2578 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2578))) (exists ((v_ArrVal_2579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2579) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,465 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2582 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2582) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2583))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,474 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2584))) (exists ((v_ArrVal_2585 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2585))) (exists ((v_arrayElimCell_19 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_19) (_ bv44 32)))) is different from true [2022-07-13 01:53:21,509 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:53:21,509 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 46 treesize of output 45 [2022-07-13 01:53:21,515 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 22 treesize of output 24 [2022-07-13 01:53:21,543 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 31 treesize of output 13 [2022-07-13 01:53:21,548 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 19 treesize of output 7 [2022-07-13 01:53:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 912 not checked. [2022-07-13 01:53:21,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:53:22,361 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-13 01:53:22,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:53:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212653493] [2022-07-13 01:53:22,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212653493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:53:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [107878873] [2022-07-13 01:53:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:53:22,367 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:53:22,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:53:22,368 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:53:22,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process