./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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_OAT_test3-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 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:51:58,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:51:58,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:51:58,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:51:58,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:51:58,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:51:58,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:51:58,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:51:58,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:51:58,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:51:58,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:51:58,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:51:58,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:51:58,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:51:58,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:51:58,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:51:58,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:51:58,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:51:58,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:51:58,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:51:58,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:51:58,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:51:58,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:51:58,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:51:58,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:51:58,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:51:58,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:51:58,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:51:58,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:51:58,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:51:58,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:51:58,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:51:58,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:51:58,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:51:58,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:51:58,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:51:58,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:51:58,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:51:58,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:51:58,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:51:58,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:51:58,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 08:51:58,913 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:51:58,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:51:58,914 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:51:58,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:51:58,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:51:58,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:51:58,916 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:51:58,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:51:58,916 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:51:58,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:51:58,917 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:51:58,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:51:58,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:51:58,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:51:58,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:51:58,918 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:51:58,918 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:51:58,918 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:51:58,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:51:58,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:51:58,918 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:51:58,919 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:51:58,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:51:58,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:51:58,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:51:58,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:51:58,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:51:58,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:51:58,921 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 08:51:58,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 08:51:58,921 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:51:58,921 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 -> 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c [2021-12-16 08:51:59,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:51:59,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:51:59,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:51:59,127 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:51:59,128 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:51:59,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2021-12-16 08:51:59,185 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0495603/59c9302328e84f778c3c9bb8df77d4cd/FLAGf5b5278da [2021-12-16 08:51:59,611 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:51:59,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2021-12-16 08:51:59,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0495603/59c9302328e84f778c3c9bb8df77d4cd/FLAGf5b5278da [2021-12-16 08:51:59,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0495603/59c9302328e84f778c3c9bb8df77d4cd [2021-12-16 08:51:59,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:51:59,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:51:59,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:51:59,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:51:59,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:51:59,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:51:59" (1/1) ... [2021-12-16 08:51:59,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fef79ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:51:59, skipping insertion in model container [2021-12-16 08:51:59,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:51:59" (1/1) ... [2021-12-16 08:51:59,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:51:59,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:51:59,986 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_OAT_test3-1.i[33021,33034] [2021-12-16 08:52:00,065 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_OAT_test3-1.i[44590,44603] [2021-12-16 08:52:00,072 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:52:00,080 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-16 08:52:00,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@28373fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:00, skipping insertion in model container [2021-12-16 08:52:00,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:52:00,081 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-16 08:52:00,083 INFO L158 Benchmark]: Toolchain (without parser) took 420.51ms. Allocated memory is still 102.8MB. Free memory was 71.8MB in the beginning and 69.0MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 08:52:00,083 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 08:52:00,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.77ms. Allocated memory is still 102.8MB. Free memory was 71.8MB in the beginning and 69.0MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 08:52:00,085 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.15ms. Allocated memory is still 102.8MB. Free memory was 60.4MB in the beginning and 60.3MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.77ms. Allocated memory is still 102.8MB. Free memory was 71.8MB in the beginning and 69.0MB in the end (delta: 2.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type 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_OAT_test3-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 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:52:01,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:52:01,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:52:01,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:52:01,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:52:01,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:52:01,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:52:01,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:52:01,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:52:01,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:52:01,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:52:01,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:52:01,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:52:01,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:52:01,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:52:01,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:52:01,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:52:01,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:52:01,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:52:01,696 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:52:01,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:52:01,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:52:01,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:52:01,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:52:01,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:52:01,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:52:01,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:52:01,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:52:01,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:52:01,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:52:01,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:52:01,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:52:01,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:52:01,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:52:01,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:52:01,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:52:01,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:52:01,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:52:01,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:52:01,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:52:01,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:52:01,717 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-16 08:52:01,739 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:52:01,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:52:01,741 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:52:01,741 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:52:01,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:52:01,742 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:52:01,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:52:01,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:52:01,743 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:52:01,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:52:01,744 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:52:01,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:52:01,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:52:01,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:52:01,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:52:01,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:52:01,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:52:01,745 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:52:01,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:52:01,745 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:52:01,746 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 08:52:01,746 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 08:52:01,746 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:52:01,746 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:52:01,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:52:01,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:52:01,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:52:01,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:52:01,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:52:01,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:52:01,747 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 08:52:01,747 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 08:52:01,748 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:52:01,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 08:52:01,748 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 -> 9a814f1cabb0a814aaaa0ad04ef0792a07c6fb7c73876a2da6ae85372115ff6c [2021-12-16 08:52:02,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:52:02,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:52:02,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:52:02,066 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:52:02,067 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:52:02,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2021-12-16 08:52:02,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250dd4070/732b8eb3804648308c0857cb8fddd8f2/FLAG66f1f3626 [2021-12-16 08:52:02,701 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:52:02,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-1.i [2021-12-16 08:52:02,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250dd4070/732b8eb3804648308c0857cb8fddd8f2/FLAG66f1f3626 [2021-12-16 08:52:03,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250dd4070/732b8eb3804648308c0857cb8fddd8f2 [2021-12-16 08:52:03,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:52:03,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:52:03,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:52:03,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:52:03,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:52:03,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ddeb7eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03, skipping insertion in model container [2021-12-16 08:52:03,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:52:03,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:52:03,509 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_OAT_test3-1.i[33021,33034] [2021-12-16 08:52:03,616 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_OAT_test3-1.i[44590,44603] [2021-12-16 08:52:03,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:52:03,627 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-16 08:52:03,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:52:03,650 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_OAT_test3-1.i[33021,33034] [2021-12-16 08:52:03,687 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_OAT_test3-1.i[44590,44603] [2021-12-16 08:52:03,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:52:03,692 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 08:52:03,711 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_OAT_test3-1.i[33021,33034] [2021-12-16 08:52:03,743 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_OAT_test3-1.i[44590,44603] [2021-12-16 08:52:03,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:52:03,773 INFO L208 MainTranslator]: Completed translation [2021-12-16 08:52:03,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03 WrapperNode [2021-12-16 08:52:03,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:52:03,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 08:52:03,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 08:52:03,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 08:52:03,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,859 INFO L137 Inliner]: procedures = 180, calls = 285, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1041 [2021-12-16 08:52:03,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 08:52:03,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 08:52:03,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 08:52:03,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 08:52:03,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 08:52:03,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 08:52:03,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 08:52:03,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 08:52:03,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (1/1) ... [2021-12-16 08:52:03,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:52:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 08:52:03,967 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) [2021-12-16 08:52:03,977 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 [2021-12-16 08:52:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 08:52:03,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-16 08:52:03,996 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-16 08:52:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 08:52:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 08:52:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 08:52:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 08:52:03,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 08:52:03,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 08:52:04,168 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 08:52:04,169 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 08:52:04,172 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-16 08:52:07,169 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 08:52:07,179 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 08:52:07,180 INFO L301 CfgBuilder]: Removed 63 assume(true) statements. [2021-12-16 08:52:07,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:52:07 BoogieIcfgContainer [2021-12-16 08:52:07,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 08:52:07,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 08:52:07,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 08:52:07,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 08:52:07,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:52:03" (1/3) ... [2021-12-16 08:52:07,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5cdcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:52:07, skipping insertion in model container [2021-12-16 08:52:07,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:52:03" (2/3) ... [2021-12-16 08:52:07,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5cdcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:52:07, skipping insertion in model container [2021-12-16 08:52:07,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:52:07" (3/3) ... [2021-12-16 08:52:07,188 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-1.i [2021-12-16 08:52:07,191 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 08:52:07,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 534 error locations. [2021-12-16 08:52:07,235 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 08:52:07,240 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-16 08:52:07,240 INFO L340 AbstractCegarLoop]: Starting to check reachability of 534 error locations. [2021-12-16 08:52:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 1072 states, 530 states have (on average 2.2452830188679247) internal successors, (1190), 1066 states have internal predecessors, (1190), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:52:07,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:07,264 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:52:07,264 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:07,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:07,267 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2021-12-16 08:52:07,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:07,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164828252] [2021-12-16 08:52:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:07,276 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:07,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:07,278 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) [2021-12-16 08:52:07,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-16 08:52:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:07,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:52:07,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:07,456 INFO L388 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 [2021-12-16 08:52:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:07,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:07,465 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:07,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164828252] [2021-12-16 08:52:07,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164828252] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:07,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:07,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:52:07,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011612973] [2021-12-16 08:52:07,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:07,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:52:07,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:07,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:52:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:07,508 INFO L87 Difference]: Start difference. First operand has 1072 states, 530 states have (on average 2.2452830188679247) internal successors, (1190), 1066 states have internal predecessors, (1190), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:08,980 INFO L93 Difference]: Finished difference Result 1067 states and 1132 transitions. [2021-12-16 08:52:08,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:52:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-16 08:52:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:08,995 INFO L225 Difference]: With dead ends: 1067 [2021-12-16 08:52:08,996 INFO L226 Difference]: Without dead ends: 1065 [2021-12-16 08:52:08,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:09,001 INFO L933 BasicCegarLoop]: 648 mSDtfsCounter, 990 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:09,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [998 Valid, 705 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-16 08:52:09,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-12-16 08:52:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1057. [2021-12-16 08:52:09,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 530 states have (on average 2.0886792452830187) internal successors, (1107), 1051 states have internal predecessors, (1107), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1123 transitions. [2021-12-16 08:52:09,083 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1123 transitions. Word has length 3 [2021-12-16 08:52:09,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:09,083 INFO L470 AbstractCegarLoop]: Abstraction has 1057 states and 1123 transitions. [2021-12-16 08:52:09,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1123 transitions. [2021-12-16 08:52:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:52:09,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:09,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:52:09,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:09,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:09,293 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:09,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:09,294 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2021-12-16 08:52:09,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:09,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22308554] [2021-12-16 08:52:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:09,295 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:09,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:09,296 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) [2021-12-16 08:52:09,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-16 08:52:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:09,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:52:09,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:09,414 INFO L388 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 [2021-12-16 08:52:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:09,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:09,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:09,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22308554] [2021-12-16 08:52:09,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22308554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:09,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:09,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:52:09,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135682275] [2021-12-16 08:52:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:09,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:52:09,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:09,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:52:09,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:09,430 INFO L87 Difference]: Start difference. First operand 1057 states and 1123 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:11,658 INFO L93 Difference]: Finished difference Result 1467 states and 1573 transitions. [2021-12-16 08:52:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:52:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-16 08:52:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:11,662 INFO L225 Difference]: With dead ends: 1467 [2021-12-16 08:52:11,662 INFO L226 Difference]: Without dead ends: 1467 [2021-12-16 08:52:11,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:11,663 INFO L933 BasicCegarLoop]: 933 mSDtfsCounter, 440 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:11,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 1522 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-16 08:52:11,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2021-12-16 08:52:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1257. [2021-12-16 08:52:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 731 states have (on average 2.0779753761969904) internal successors, (1519), 1251 states have internal predecessors, (1519), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:11,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1535 transitions. [2021-12-16 08:52:11,684 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1535 transitions. Word has length 3 [2021-12-16 08:52:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:11,684 INFO L470 AbstractCegarLoop]: Abstraction has 1257 states and 1535 transitions. [2021-12-16 08:52:11,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1535 transitions. [2021-12-16 08:52:11,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 08:52:11,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:11,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:11,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:11,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:11,891 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:11,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:11,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2021-12-16 08:52:11,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:11,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704574804] [2021-12-16 08:52:11,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:11,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:11,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:11,894 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) [2021-12-16 08:52:11,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-16 08:52:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:11,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:52:11,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:12,010 INFO L388 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 [2021-12-16 08:52:12,015 INFO L388 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 [2021-12-16 08:52:12,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:52:12,084 INFO L388 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 [2021-12-16 08:52:12,094 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:52:12,095 INFO L388 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 14 treesize of output 14 [2021-12-16 08:52:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:12,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:12,124 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:12,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704574804] [2021-12-16 08:52:12,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704574804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:12,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:12,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:52:12,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376004759] [2021-12-16 08:52:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:12,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:12,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:12,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:12,129 INFO L87 Difference]: Start difference. First operand 1257 states and 1535 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:14,072 INFO L93 Difference]: Finished difference Result 1258 states and 1538 transitions. [2021-12-16 08:52:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:52:14,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 08:52:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:14,077 INFO L225 Difference]: With dead ends: 1258 [2021-12-16 08:52:14,077 INFO L226 Difference]: Without dead ends: 1258 [2021-12-16 08:52:14,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:14,079 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 2051 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:14,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2059 Valid, 409 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-16 08:52:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2021-12-16 08:52:14,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1046. [2021-12-16 08:52:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 530 states have (on average 2.0660377358490565) internal successors, (1095), 1040 states have internal predecessors, (1095), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1111 transitions. [2021-12-16 08:52:14,100 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1111 transitions. Word has length 7 [2021-12-16 08:52:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:14,100 INFO L470 AbstractCegarLoop]: Abstraction has 1046 states and 1111 transitions. [2021-12-16 08:52:14,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1111 transitions. [2021-12-16 08:52:14,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:52:14,101 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:14,101 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:14,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-16 08:52:14,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:14,307 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2021-12-16 08:52:14,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:14,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745813898] [2021-12-16 08:52:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:14,308 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:14,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:14,309 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) [2021-12-16 08:52:14,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-16 08:52:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:14,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:52:14,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:14,426 INFO L388 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 [2021-12-16 08:52:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:14,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:14,440 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:14,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745813898] [2021-12-16 08:52:14,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745813898] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:14,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:14,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:52:14,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035950764] [2021-12-16 08:52:14,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:14,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:52:14,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:14,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:52:14,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:14,442 INFO L87 Difference]: Start difference. First operand 1046 states and 1111 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:16,094 INFO L93 Difference]: Finished difference Result 1373 states and 1467 transitions. [2021-12-16 08:52:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:52:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-16 08:52:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:16,102 INFO L225 Difference]: With dead ends: 1373 [2021-12-16 08:52:16,102 INFO L226 Difference]: Without dead ends: 1373 [2021-12-16 08:52:16,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:16,106 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 990 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:16,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [998 Valid, 1198 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 08:52:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-12-16 08:52:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 997. [2021-12-16 08:52:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 530 states have (on average 1.9735849056603774) internal successors, (1046), 991 states have internal predecessors, (1046), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1062 transitions. [2021-12-16 08:52:16,127 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1062 transitions. Word has length 8 [2021-12-16 08:52:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:16,127 INFO L470 AbstractCegarLoop]: Abstraction has 997 states and 1062 transitions. [2021-12-16 08:52:16,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1062 transitions. [2021-12-16 08:52:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:52:16,128 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:16,128 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:16,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:16,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:16,351 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:16,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:16,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2021-12-16 08:52:16,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:16,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421717216] [2021-12-16 08:52:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:16,352 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:16,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:16,353 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) [2021-12-16 08:52:16,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-16 08:52:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:16,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:52:16,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:16,457 INFO L388 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 [2021-12-16 08:52:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:16,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:16,482 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:16,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421717216] [2021-12-16 08:52:16,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421717216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:16,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:16,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:52:16,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141503320] [2021-12-16 08:52:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:16,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:52:16,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:52:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:16,483 INFO L87 Difference]: Start difference. First operand 997 states and 1062 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:18,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:18,402 INFO L93 Difference]: Finished difference Result 1451 states and 1548 transitions. [2021-12-16 08:52:18,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:52:18,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-16 08:52:18,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:18,406 INFO L225 Difference]: With dead ends: 1451 [2021-12-16 08:52:18,406 INFO L226 Difference]: Without dead ends: 1451 [2021-12-16 08:52:18,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:18,407 INFO L933 BasicCegarLoop]: 1162 mSDtfsCounter, 673 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:18,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 1601 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-16 08:52:18,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2021-12-16 08:52:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1019. [2021-12-16 08:52:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 562 states have (on average 1.9608540925266904) internal successors, (1102), 1013 states have internal predecessors, (1102), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1118 transitions. [2021-12-16 08:52:18,424 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1118 transitions. Word has length 8 [2021-12-16 08:52:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:18,425 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1118 transitions. [2021-12-16 08:52:18,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1118 transitions. [2021-12-16 08:52:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 08:52:18,425 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:18,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:18,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:18,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:18,632 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:18,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:18,633 INFO L85 PathProgramCache]: Analyzing trace with hash 871377621, now seen corresponding path program 1 times [2021-12-16 08:52:18,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:18,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258757218] [2021-12-16 08:52:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:18,634 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:18,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:18,636 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) [2021-12-16 08:52:18,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-16 08:52:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:18,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 08:52:18,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:18,792 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:18,792 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:18,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258757218] [2021-12-16 08:52:18,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258757218] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:18,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:18,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:52:18,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234693033] [2021-12-16 08:52:18,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:18,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:18,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:18,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:18,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:18,796 INFO L87 Difference]: Start difference. First operand 1019 states and 1118 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-16 08:52:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:19,314 INFO L93 Difference]: Finished difference Result 1469 states and 1601 transitions. [2021-12-16 08:52:19,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:52:19,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2021-12-16 08:52:19,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:19,318 INFO L225 Difference]: With dead ends: 1469 [2021-12-16 08:52:19,318 INFO L226 Difference]: Without dead ends: 1469 [2021-12-16 08:52:19,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:19,319 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 547 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:19,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 3019 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-16 08:52:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2021-12-16 08:52:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1259. [2021-12-16 08:52:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 802 states have (on average 1.9413965087281795) internal successors, (1557), 1253 states have internal predecessors, (1557), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1573 transitions. [2021-12-16 08:52:19,342 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1573 transitions. Word has length 11 [2021-12-16 08:52:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:19,342 INFO L470 AbstractCegarLoop]: Abstraction has 1259 states and 1573 transitions. [2021-12-16 08:52:19,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2021-12-16 08:52:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1573 transitions. [2021-12-16 08:52:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 08:52:19,343 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:19,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:19,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:19,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:19,552 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr532ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:19,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1242903717, now seen corresponding path program 1 times [2021-12-16 08:52:19,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:19,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090113115] [2021-12-16 08:52:19,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:19,556 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:19,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:19,557 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) [2021-12-16 08:52:19,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-16 08:52:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:19,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:52:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:19,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:52:19,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:52:19,698 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:52:19,737 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-16 08:52:19,738 INFO L388 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-16 08:52:19,782 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-16 08:52:19,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-16 08:52:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:19,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:19,799 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:19,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090113115] [2021-12-16 08:52:19,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090113115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:19,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:19,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:52:19,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779633383] [2021-12-16 08:52:19,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:19,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:19,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:19,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:19,801 INFO L87 Difference]: Start difference. First operand 1259 states and 1573 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-16 08:52:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:20,790 INFO L93 Difference]: Finished difference Result 1633 states and 2017 transitions. [2021-12-16 08:52:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:52:20,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2021-12-16 08:52:20,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:20,795 INFO L225 Difference]: With dead ends: 1633 [2021-12-16 08:52:20,795 INFO L226 Difference]: Without dead ends: 1633 [2021-12-16 08:52:20,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:20,796 INFO L933 BasicCegarLoop]: 1002 mSDtfsCounter, 373 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:20,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 2889 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-16 08:52:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-12-16 08:52:20,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1258. [2021-12-16 08:52:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 801 states have (on average 1.941323345817728) internal successors, (1555), 1252 states have internal predecessors, (1555), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1571 transitions. [2021-12-16 08:52:20,814 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1571 transitions. Word has length 12 [2021-12-16 08:52:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:20,814 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1571 transitions. [2021-12-16 08:52:20,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-16 08:52:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1571 transitions. [2021-12-16 08:52:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 08:52:20,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:20,815 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:20,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-16 08:52:21,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:21,024 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:21,025 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2021-12-16 08:52:21,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:21,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207174809] [2021-12-16 08:52:21,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:21,025 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:21,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:21,026 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) [2021-12-16 08:52:21,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-16 08:52:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:21,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 08:52:21,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:21,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:21,174 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:21,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207174809] [2021-12-16 08:52:21,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207174809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:21,174 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:21,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:52:21,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606472258] [2021-12-16 08:52:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:21,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:52:21,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:52:21,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:21,176 INFO L87 Difference]: Start difference. First operand 1258 states and 1571 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:21,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:21,195 INFO L93 Difference]: Finished difference Result 1198 states and 1485 transitions. [2021-12-16 08:52:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:52:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 08:52:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:21,199 INFO L225 Difference]: With dead ends: 1198 [2021-12-16 08:52:21,199 INFO L226 Difference]: Without dead ends: 1198 [2021-12-16 08:52:21,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:52:21,200 INFO L933 BasicCegarLoop]: 1005 mSDtfsCounter, 974 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1037 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 [2021-12-16 08:52:21,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 1037 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:52:21,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2021-12-16 08:52:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2021-12-16 08:52:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 765 states have (on average 1.9202614379084968) internal successors, (1469), 1192 states have internal predecessors, (1469), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:21,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1485 transitions. [2021-12-16 08:52:21,218 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1485 transitions. Word has length 18 [2021-12-16 08:52:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:21,218 INFO L470 AbstractCegarLoop]: Abstraction has 1198 states and 1485 transitions. [2021-12-16 08:52:21,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1485 transitions. [2021-12-16 08:52:21,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 08:52:21,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:21,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:21,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:21,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:21,429 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:21,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2021-12-16 08:52:21,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:21,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388990323] [2021-12-16 08:52:21,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:21,430 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:21,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:21,431 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) [2021-12-16 08:52:21,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-16 08:52:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:21,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:52:21,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:21,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:21,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:21,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388990323] [2021-12-16 08:52:21,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388990323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:21,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:21,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:52:21,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221645654] [2021-12-16 08:52:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:21,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:21,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:21,612 INFO L87 Difference]: Start difference. First operand 1198 states and 1485 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:21,669 INFO L93 Difference]: Finished difference Result 1170 states and 1429 transitions. [2021-12-16 08:52:21,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:52:21,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-16 08:52:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:21,673 INFO L225 Difference]: With dead ends: 1170 [2021-12-16 08:52:21,673 INFO L226 Difference]: Without dead ends: 1170 [2021-12-16 08:52:21,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:21,674 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 945 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1945 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 [2021-12-16 08:52:21,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 1945 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:52:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2021-12-16 08:52:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1168. [2021-12-16 08:52:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 749 states have (on average 1.883845126835781) internal successors, (1411), 1162 states have internal predecessors, (1411), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1427 transitions. [2021-12-16 08:52:21,694 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1427 transitions. Word has length 20 [2021-12-16 08:52:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:21,694 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 1427 transitions. [2021-12-16 08:52:21,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:21,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1427 transitions. [2021-12-16 08:52:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:52:21,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:21,695 INFO L514 BasicCegarLoop]: 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] [2021-12-16 08:52:21,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-16 08:52:21,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:21,905 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2021-12-16 08:52:21,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:21,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655089819] [2021-12-16 08:52:21,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:21,907 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:21,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:21,907 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) [2021-12-16 08:52:21,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-16 08:52:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:22,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:52:22,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:22,055 INFO L388 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 [2021-12-16 08:52:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:22,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:22,138 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:22,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655089819] [2021-12-16 08:52:22,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655089819] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:22,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:22,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:52:22,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739141907] [2021-12-16 08:52:22,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:22,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:22,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:22,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:22,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:22,139 INFO L87 Difference]: Start difference. First operand 1168 states and 1427 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:23,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:23,739 INFO L93 Difference]: Finished difference Result 1648 states and 2039 transitions. [2021-12-16 08:52:23,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:52:23,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 08:52:23,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:23,744 INFO L225 Difference]: With dead ends: 1648 [2021-12-16 08:52:23,744 INFO L226 Difference]: Without dead ends: 1648 [2021-12-16 08:52:23,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:23,745 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 1733 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:23,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1738 Valid, 1058 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 08:52:23,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2021-12-16 08:52:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1164. [2021-12-16 08:52:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 749 states have (on average 1.8731642189586115) internal successors, (1403), 1158 states have internal predecessors, (1403), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1419 transitions. [2021-12-16 08:52:23,758 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1419 transitions. Word has length 34 [2021-12-16 08:52:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:23,758 INFO L470 AbstractCegarLoop]: Abstraction has 1164 states and 1419 transitions. [2021-12-16 08:52:23,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1419 transitions. [2021-12-16 08:52:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:52:23,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:23,759 INFO L514 BasicCegarLoop]: 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] [2021-12-16 08:52:23,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:23,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:23,967 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:23,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:23,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2021-12-16 08:52:23,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:23,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559737344] [2021-12-16 08:52:23,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:23,968 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:23,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:23,969 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) [2021-12-16 08:52:23,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-16 08:52:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:24,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 08:52:24,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:24,113 INFO L388 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 [2021-12-16 08:52:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:24,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:24,295 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:24,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559737344] [2021-12-16 08:52:24,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559737344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:24,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:24,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:52:24,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873342511] [2021-12-16 08:52:24,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:24,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:24,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:24,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:24,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:24,297 INFO L87 Difference]: Start difference. First operand 1164 states and 1419 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:26,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:26,558 INFO L93 Difference]: Finished difference Result 1782 states and 2197 transitions. [2021-12-16 08:52:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:52:26,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 08:52:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:26,563 INFO L225 Difference]: With dead ends: 1782 [2021-12-16 08:52:26,563 INFO L226 Difference]: Without dead ends: 1782 [2021-12-16 08:52:26,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:26,563 INFO L933 BasicCegarLoop]: 1232 mSDtfsCounter, 1176 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:26,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 2136 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-16 08:52:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2021-12-16 08:52:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1160. [2021-12-16 08:52:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 749 states have (on average 1.8624833110814418) internal successors, (1395), 1154 states have internal predecessors, (1395), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1411 transitions. [2021-12-16 08:52:26,577 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1411 transitions. Word has length 34 [2021-12-16 08:52:26,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:26,577 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 1411 transitions. [2021-12-16 08:52:26,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:52:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1411 transitions. [2021-12-16 08:52:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-16 08:52:26,582 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:26,582 INFO L514 BasicCegarLoop]: 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] [2021-12-16 08:52:26,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-16 08:52:26,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:26,790 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:26,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2021-12-16 08:52:26,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:26,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171046590] [2021-12-16 08:52:26,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:26,791 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:26,792 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) [2021-12-16 08:52:26,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-16 08:52:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:26,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:52:26,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:27,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:27,037 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:27,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171046590] [2021-12-16 08:52:27,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171046590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:27,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:27,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:52:27,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64994944] [2021-12-16 08:52:27,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:27,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:27,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:27,040 INFO L87 Difference]: Start difference. First operand 1160 states and 1411 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2021-12-16 08:52:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:27,074 INFO L93 Difference]: Finished difference Result 1148 states and 1391 transitions. [2021-12-16 08:52:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:52:27,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2021-12-16 08:52:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:27,083 INFO L225 Difference]: With dead ends: 1148 [2021-12-16 08:52:27,083 INFO L226 Difference]: Without dead ends: 1148 [2021-12-16 08:52:27,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:27,084 INFO L933 BasicCegarLoop]: 954 mSDtfsCounter, 921 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1923 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 [2021-12-16 08:52:27,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 1923 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:52:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-12-16 08:52:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2021-12-16 08:52:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 737 states have (on average 1.8656716417910448) internal successors, (1375), 1142 states have internal predecessors, (1375), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1391 transitions. [2021-12-16 08:52:27,095 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1391 transitions. Word has length 52 [2021-12-16 08:52:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:27,096 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 1391 transitions. [2021-12-16 08:52:27,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2021-12-16 08:52:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1391 transitions. [2021-12-16 08:52:27,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 08:52:27,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:27,096 INFO L514 BasicCegarLoop]: 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] [2021-12-16 08:52:27,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-16 08:52:27,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:27,306 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:27,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2021-12-16 08:52:27,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:27,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654339411] [2021-12-16 08:52:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:27,307 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:27,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:27,308 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) [2021-12-16 08:52:27,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-16 08:52:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:27,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:52:27,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:27,582 INFO L388 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 [2021-12-16 08:52:27,588 INFO L388 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 [2021-12-16 08:52:28,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:52:28,030 INFO L388 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 [2021-12-16 08:52:28,039 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:52:28,040 INFO L388 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 14 treesize of output 14 [2021-12-16 08:52:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:28,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:28,055 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:28,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654339411] [2021-12-16 08:52:28,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654339411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:28,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:28,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:52:28,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412061906] [2021-12-16 08:52:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:28,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:28,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:28,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:28,058 INFO L87 Difference]: Start difference. First operand 1148 states and 1391 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2021-12-16 08:52:30,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:30,198 INFO L93 Difference]: Finished difference Result 1560 states and 1928 transitions. [2021-12-16 08:52:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:52:30,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2021-12-16 08:52:30,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:30,203 INFO L225 Difference]: With dead ends: 1560 [2021-12-16 08:52:30,203 INFO L226 Difference]: Without dead ends: 1560 [2021-12-16 08:52:30,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:30,204 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 2042 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:30,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2045 Valid, 522 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-16 08:52:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-12-16 08:52:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1078. [2021-12-16 08:52:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 705 states have (on average 1.8028368794326242) internal successors, (1271), 1072 states have internal predecessors, (1271), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1287 transitions. [2021-12-16 08:52:30,216 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1287 transitions. Word has length 60 [2021-12-16 08:52:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:30,216 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1287 transitions. [2021-12-16 08:52:30,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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) [2021-12-16 08:52:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1287 transitions. [2021-12-16 08:52:30,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:52:30,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:30,218 INFO L514 BasicCegarLoop]: 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] [2021-12-16 08:52:30,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:30,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:30,435 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:30,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2021-12-16 08:52:30,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:30,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167225824] [2021-12-16 08:52:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:30,436 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:30,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:30,437 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) [2021-12-16 08:52:30,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-16 08:52:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:30,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:52:30,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:30,720 INFO L388 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 [2021-12-16 08:52:30,732 INFO L388 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 [2021-12-16 08:52:30,756 INFO L388 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 24 treesize of output 12 [2021-12-16 08:52:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:30,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:30,764 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:30,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167225824] [2021-12-16 08:52:30,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167225824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:30,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:30,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:52:30,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238606584] [2021-12-16 08:52:30,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:30,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:52:30,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:30,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:52:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:30,765 INFO L87 Difference]: Start difference. First operand 1078 states and 1287 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:52:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:32,367 INFO L93 Difference]: Finished difference Result 1077 states and 1286 transitions. [2021-12-16 08:52:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:52:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2021-12-16 08:52:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:32,370 INFO L225 Difference]: With dead ends: 1077 [2021-12-16 08:52:32,371 INFO L226 Difference]: Without dead ends: 1077 [2021-12-16 08:52:32,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 08:52:32,371 INFO L933 BasicCegarLoop]: 914 mSDtfsCounter, 4 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:32,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2357 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-16 08:52:32,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2021-12-16 08:52:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2021-12-16 08:52:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 705 states have (on average 1.801418439716312) internal successors, (1270), 1071 states have internal predecessors, (1270), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1286 transitions. [2021-12-16 08:52:32,381 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1286 transitions. Word has length 65 [2021-12-16 08:52:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:32,382 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1286 transitions. [2021-12-16 08:52:32,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:52:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1286 transitions. [2021-12-16 08:52:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:52:32,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:32,383 INFO L514 BasicCegarLoop]: 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] [2021-12-16 08:52:32,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:32,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:32,592 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2021-12-16 08:52:32,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:32,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866600679] [2021-12-16 08:52:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:32,593 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:32,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:32,594 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) [2021-12-16 08:52:32,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-16 08:52:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:32,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 08:52:32,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:32,914 INFO L388 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 [2021-12-16 08:52:32,941 INFO L388 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 [2021-12-16 08:52:32,948 INFO L388 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 [2021-12-16 08:52:32,989 INFO L388 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 [2021-12-16 08:52:32,993 INFO L388 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 [2021-12-16 08:52:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:33,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:33,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:33,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866600679] [2021-12-16 08:52:33,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866600679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:33,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:33,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:52:33,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15676730] [2021-12-16 08:52:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:33,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:52:33,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:52:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:33,007 INFO L87 Difference]: Start difference. First operand 1077 states and 1286 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:52:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:35,314 INFO L93 Difference]: Finished difference Result 1076 states and 1285 transitions. [2021-12-16 08:52:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:52:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2021-12-16 08:52:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:35,317 INFO L225 Difference]: With dead ends: 1076 [2021-12-16 08:52:35,317 INFO L226 Difference]: Without dead ends: 1076 [2021-12-16 08:52:35,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 08:52:35,318 INFO L933 BasicCegarLoop]: 914 mSDtfsCounter, 2 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:35,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2394 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-16 08:52:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2021-12-16 08:52:35,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2021-12-16 08:52:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 704 states have (on average 1.8025568181818181) internal successors, (1269), 1070 states have internal predecessors, (1269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:52:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1285 transitions. [2021-12-16 08:52:35,333 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1285 transitions. Word has length 65 [2021-12-16 08:52:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:35,334 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1285 transitions. [2021-12-16 08:52:35,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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) [2021-12-16 08:52:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1285 transitions. [2021-12-16 08:52:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-16 08:52:35,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:35,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:35,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:35,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:35,544 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:35,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:35,544 INFO L85 PathProgramCache]: Analyzing trace with hash 845908815, now seen corresponding path program 1 times [2021-12-16 08:52:35,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:35,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23643431] [2021-12-16 08:52:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:35,545 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:35,546 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) [2021-12-16 08:52:35,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-16 08:52:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:35,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:52:35,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:35,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:52:35,882 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:35,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23643431] [2021-12-16 08:52:35,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23643431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:52:35,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:52:35,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:52:35,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198538187] [2021-12-16 08:52:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:52:35,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:52:35,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:52:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:52:35,883 INFO L87 Difference]: Start difference. First operand 1076 states and 1285 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-12-16 08:52:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:35,939 INFO L93 Difference]: Finished difference Result 1079 states and 1289 transitions. [2021-12-16 08:52:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:52:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2021-12-16 08:52:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:35,943 INFO L225 Difference]: With dead ends: 1079 [2021-12-16 08:52:35,943 INFO L226 Difference]: Without dead ends: 1079 [2021-12-16 08:52:35,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:52:35,944 INFO L933 BasicCegarLoop]: 914 mSDtfsCounter, 2 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:35,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2737 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:52:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-12-16 08:52:35,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2021-12-16 08:52:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 706 states have (on average 1.801699716713881) internal successors, (1272), 1073 states have internal predecessors, (1272), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:52:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1289 transitions. [2021-12-16 08:52:35,956 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1289 transitions. Word has length 73 [2021-12-16 08:52:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:35,957 INFO L470 AbstractCegarLoop]: Abstraction has 1079 states and 1289 transitions. [2021-12-16 08:52:35,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-12-16 08:52:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1289 transitions. [2021-12-16 08:52:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-16 08:52:35,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:35,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:35,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:36,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:36,168 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1432329570, now seen corresponding path program 1 times [2021-12-16 08:52:36,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:36,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646847760] [2021-12-16 08:52:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:52:36,169 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:36,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:36,170 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) [2021-12-16 08:52:36,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-16 08:52:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:52:36,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:52:36,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:36,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:52:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:36,629 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:36,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646847760] [2021-12-16 08:52:36,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646847760] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:52:36,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:52:36,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-16 08:52:36,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109395782] [2021-12-16 08:52:36,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:52:36,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 08:52:36,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 08:52:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 08:52:36,630 INFO L87 Difference]: Start difference. First operand 1079 states and 1289 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2021-12-16 08:52:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:36,752 INFO L93 Difference]: Finished difference Result 1091 states and 1306 transitions. [2021-12-16 08:52:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 08:52:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 74 [2021-12-16 08:52:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:36,759 INFO L225 Difference]: With dead ends: 1091 [2021-12-16 08:52:36,759 INFO L226 Difference]: Without dead ends: 1091 [2021-12-16 08:52:36,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-12-16 08:52:36,760 INFO L933 BasicCegarLoop]: 915 mSDtfsCounter, 12 mSDsluCounter, 5459 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6374 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:36,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 6374 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 08:52:36,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-12-16 08:52:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1089. [2021-12-16 08:52:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 715 states have (on average 1.8) internal successors, (1287), 1082 states have internal predecessors, (1287), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:52:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1304 transitions. [2021-12-16 08:52:36,772 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1304 transitions. Word has length 74 [2021-12-16 08:52:36,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:36,772 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 1304 transitions. [2021-12-16 08:52:36,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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) [2021-12-16 08:52:36,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1304 transitions. [2021-12-16 08:52:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-16 08:52:36,773 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:36,773 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:36,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:36,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:36,985 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1474885647, now seen corresponding path program 2 times [2021-12-16 08:52:36,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:36,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631404569] [2021-12-16 08:52:36,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 08:52:36,986 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:36,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:36,986 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) [2021-12-16 08:52:36,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-16 08:52:37,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 08:52:37,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:52:37,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:52:37,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:37,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:37,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:52:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:37,732 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:37,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631404569] [2021-12-16 08:52:37,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631404569] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:52:37,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:52:37,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-16 08:52:37,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224087918] [2021-12-16 08:52:37,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:52:37,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 08:52:37,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 08:52:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-16 08:52:37,734 INFO L87 Difference]: Start difference. First operand 1089 states and 1304 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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) [2021-12-16 08:52:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:38,182 INFO L93 Difference]: Finished difference Result 1110 states and 1332 transitions. [2021-12-16 08:52:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-16 08:52:38,182 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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 77 [2021-12-16 08:52:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:38,185 INFO L225 Difference]: With dead ends: 1110 [2021-12-16 08:52:38,185 INFO L226 Difference]: Without dead ends: 1106 [2021-12-16 08:52:38,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-16 08:52:38,186 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 59 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5492 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:38,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 5492 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 08:52:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-12-16 08:52:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1098. [2021-12-16 08:52:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 724 states have (on average 1.7941988950276244) internal successors, (1299), 1091 states have internal predecessors, (1299), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:52:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1316 transitions. [2021-12-16 08:52:38,203 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1316 transitions. Word has length 77 [2021-12-16 08:52:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:38,204 INFO L470 AbstractCegarLoop]: Abstraction has 1098 states and 1316 transitions. [2021-12-16 08:52:38,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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) [2021-12-16 08:52:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1316 transitions. [2021-12-16 08:52:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 08:52:38,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:38,204 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:38,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:38,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:38,421 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:38,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:38,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1848370991, now seen corresponding path program 3 times [2021-12-16 08:52:38,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:38,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647722633] [2021-12-16 08:52:38,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 08:52:38,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:38,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:38,423 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) [2021-12-16 08:52:38,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-16 08:52:39,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-16 08:52:39,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:52:39,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 08:52:39,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:39,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:52:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:39,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:39,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647722633] [2021-12-16 08:52:39,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647722633] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:52:39,959 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:52:39,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-16 08:52:39,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953834372] [2021-12-16 08:52:39,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:52:39,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-16 08:52:39,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:39,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 08:52:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-16 08:52:39,960 INFO L87 Difference]: Start difference. First operand 1098 states and 1316 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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) [2021-12-16 08:52:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:42,400 INFO L93 Difference]: Finished difference Result 1140 states and 1378 transitions. [2021-12-16 08:52:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-16 08:52:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 83 [2021-12-16 08:52:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:42,403 INFO L225 Difference]: With dead ends: 1140 [2021-12-16 08:52:42,403 INFO L226 Difference]: Without dead ends: 1134 [2021-12-16 08:52:42,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-16 08:52:42,404 INFO L933 BasicCegarLoop]: 923 mSDtfsCounter, 178 mSDsluCounter, 11018 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 11941 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:42,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 11941 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 08:52:42,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2021-12-16 08:52:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1116. [2021-12-16 08:52:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 742 states have (on average 1.7816711590296497) internal successors, (1322), 1109 states have internal predecessors, (1322), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:52:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1339 transitions. [2021-12-16 08:52:42,423 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1339 transitions. Word has length 83 [2021-12-16 08:52:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:42,423 INFO L470 AbstractCegarLoop]: Abstraction has 1116 states and 1339 transitions. [2021-12-16 08:52:42,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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) [2021-12-16 08:52:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1339 transitions. [2021-12-16 08:52:42,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-16 08:52:42,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:42,424 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:42,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:42,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:42,637 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:42,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1078182545, now seen corresponding path program 4 times [2021-12-16 08:52:42,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:42,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672009527] [2021-12-16 08:52:42,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 08:52:42,639 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:42,639 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-16 08:52:42,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-16 08:52:42,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 08:52:42,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:52:42,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 08:52:42,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:43,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:52:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:52:44,870 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:44,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672009527] [2021-12-16 08:52:44,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672009527] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:52:44,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:52:44,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-16 08:52:44,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476806639] [2021-12-16 08:52:44,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:52:44,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-16 08:52:44,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:52:44,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-16 08:52:44,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-16 08:52:44,872 INFO L87 Difference]: Start difference. First operand 1116 states and 1339 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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) [2021-12-16 08:52:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:52:54,975 INFO L93 Difference]: Finished difference Result 1196 states and 1451 transitions. [2021-12-16 08:52:54,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-16 08:52:54,976 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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 95 [2021-12-16 08:52:54,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:52:54,978 INFO L225 Difference]: With dead ends: 1196 [2021-12-16 08:52:54,979 INFO L226 Difference]: Without dead ends: 1192 [2021-12-16 08:52:54,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-16 08:52:54,983 INFO L933 BasicCegarLoop]: 935 mSDtfsCounter, 368 mSDsluCounter, 24143 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 25078 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-16 08:52:54,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 25078 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-16 08:52:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2021-12-16 08:52:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1150. [2021-12-16 08:52:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 776 states have (on average 1.7628865979381443) internal successors, (1368), 1143 states have internal predecessors, (1368), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:52:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1385 transitions. [2021-12-16 08:52:55,002 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1385 transitions. Word has length 95 [2021-12-16 08:52:55,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:52:55,002 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 1385 transitions. [2021-12-16 08:52:55,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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) [2021-12-16 08:52:55,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1385 transitions. [2021-12-16 08:52:55,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-16 08:52:55,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:52:55,003 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:52:55,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-16 08:52:55,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-16 08:52:55,214 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:52:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:52:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 869177231, now seen corresponding path program 5 times [2021-12-16 08:52:55,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:52:55,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215942670] [2021-12-16 08:52:55,216 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:52:55,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:52:55,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:52:55,226 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) [2021-12-16 08:52:55,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-16 08:52:56,374 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-16 08:52:56,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:52:56,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-16 08:52:56,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:52:56,421 INFO L388 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 [2021-12-16 08:52:56,517 INFO L388 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 [2021-12-16 08:52:56,524 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:52:56,524 INFO L388 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 14 treesize of output 14 [2021-12-16 08:52:56,541 INFO L388 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 [2021-12-16 08:52:56,548 INFO L388 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 [2021-12-16 08:52:56,621 INFO L388 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 [2021-12-16 08:52:56,624 INFO L388 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 [2021-12-16 08:52:56,703 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1881))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1880)))) is different from true [2021-12-16 08:52:56,717 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1882))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1883)))) is different from true [2021-12-16 08:52:56,729 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1885))) (exists ((v_ArrVal_1884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1884)))) is different from true [2021-12-16 08:52:56,744 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1887))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1886 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1886)))) is different from true [2021-12-16 08:52:56,771 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1889))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1888)))) is different from true [2021-12-16 08:52:56,782 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1891 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1891))) (exists ((v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1890)))) is different from true [2021-12-16 08:52:56,795 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1892 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1892))) (exists ((v_ArrVal_1893 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1893))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:56,808 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1895))) (exists ((v_ArrVal_1894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1894))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:56,849 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1898))) (exists ((v_ArrVal_1899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1899))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:56,859 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1901))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1900 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1900)))) is different from true [2021-12-16 08:52:56,875 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1902))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1903)))) is different from true [2021-12-16 08:52:56,892 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1904))) (exists ((v_ArrVal_1905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1905)))) is different from true [2021-12-16 08:52:56,905 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1906))) (exists ((v_ArrVal_1907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1907)))) is different from true [2021-12-16 08:52:56,916 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1908))) (exists ((v_ArrVal_1909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1909)))) is different from true [2021-12-16 08:52:56,924 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1911))) (exists ((v_ArrVal_1910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1910))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:56,933 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912)))) is different from true [2021-12-16 08:52:56,949 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914)))) is different from true [2021-12-16 08:52:56,958 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917)))) is different from true [2021-12-16 08:52:56,967 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918)))) is different from true [2021-12-16 08:52:56,977 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:56,986 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:56,995 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925)))) is different from true [2021-12-16 08:52:57,004 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926)))) is different from true [2021-12-16 08:52:57,013 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928)))) is different from true [2021-12-16 08:52:57,023 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:57,033 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932)))) is different from true [2021-12-16 08:52:57,043 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934)))) is different from true [2021-12-16 08:52:57,053 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937)))) is different from true [2021-12-16 08:52:57,065 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1938))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1939)))) is different from true [2021-12-16 08:52:57,074 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940)))) is different from true [2021-12-16 08:52:57,093 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:57,103 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1944 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1944))) (exists ((v_ArrVal_1945 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1945))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:57,112 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1946 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1946))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1947 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1947)))) is different from true [2021-12-16 08:52:57,122 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948))) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949)))) is different from true [2021-12-16 08:52:57,142 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950)))) is different from true [2021-12-16 08:52:57,153 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952)))) is different from true [2021-12-16 08:52:57,163 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1955 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1955))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1954 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1954)))) is different from true [2021-12-16 08:52:57,187 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957)))) is different from true [2021-12-16 08:52:57,196 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959)))) is different from true [2021-12-16 08:52:57,205 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961)))) is different from true [2021-12-16 08:52:57,214 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962)))) is different from true [2021-12-16 08:52:57,222 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1965 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1965))) (exists ((v_ArrVal_1964 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1964))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:52:57,254 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 08:52:57,255 INFO L388 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 [2021-12-16 08:52:57,261 INFO L388 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 [2021-12-16 08:52:57,296 INFO L388 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 [2021-12-16 08:52:57,301 INFO L388 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 [2021-12-16 08:52:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 987 not checked. [2021-12-16 08:52:57,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:52:57,932 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2056 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-16 08:52:57,939 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:52:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215942670] [2021-12-16 08:52:57,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215942670] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 08:52:57,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1799966892] [2021-12-16 08:52:57,940 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:52:57,940 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-16 08:52:57,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-16 08:52:57,941 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) [2021-12-16 08:52:57,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process