./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b 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/memsafety-ext2/complex_data_creation_test01-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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:38:54,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:38:54,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:38:54,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:38:54,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:38:54,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:38:54,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:38:54,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:38:54,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:38:54,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:38:54,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:38:54,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:38:54,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:38:54,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:38:54,964 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:38:54,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:38:54,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:38:54,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:38:54,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:38:54,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:38:54,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:38:54,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:38:54,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:38:54,977 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:38:54,980 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:38:54,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:38:54,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:38:54,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:38:54,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:38:54,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:38:54,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:38:54,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:38:54,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:38:54,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:38:54,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:38:54,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:38:54,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:38:54,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:38:54,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:38:54,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:38:54,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:38:54,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:38:55,009 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:38:55,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:38:55,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:38:55,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:38:55,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:38:55,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:38:55,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:38:55,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:38:55,012 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:38:55,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:38:55,012 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:38:55,012 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:38:55,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:38:55,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:38:55,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:38:55,013 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:38:55,013 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:38:55,013 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:38:55,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:38:55,014 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:38:55,014 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:38:55,014 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:38:55,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:38:55,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:38:55,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:38:55,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:38:55,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:38:55,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:38:55,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:38:55,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:38:55,016 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:38:55,016 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2021-12-14 19:38:55,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:38:55,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:38:55,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:38:55,232 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:38:55,232 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:38:55,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2021-12-14 19:38:55,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d80720b7/eb159ee2de8942b9944a6b1542ba9778/FLAG36456b628 [2021-12-14 19:38:55,695 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:38:55,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2021-12-14 19:38:55,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d80720b7/eb159ee2de8942b9944a6b1542ba9778/FLAG36456b628 [2021-12-14 19:38:56,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d80720b7/eb159ee2de8942b9944a6b1542ba9778 [2021-12-14 19:38:56,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:38:56,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:38:56,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:56,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:38:56,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:38:56,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:56" (1/1) ... [2021-12-14 19:38:56,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce60ac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:56, skipping insertion in model container [2021-12-14 19:38:56,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:56" (1/1) ... [2021-12-14 19:38:56,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:38:56,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:38:56,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:38:56,361 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-14 19:38:56,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65017167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:56, skipping insertion in model container [2021-12-14 19:38:56,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:56,363 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-14 19:38:56,365 INFO L158 Benchmark]: Toolchain (without parser) took 281.06ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.9MB in the beginning and 85.8MB in the end (delta: -31.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-12-14 19:38:56,366 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 39.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:38:56,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.02ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.6MB in the beginning and 85.8MB in the end (delta: -32.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-12-14 19:38:56,370 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.18ms. Allocated memory is still 88.1MB. Free memory was 45.0MB in the beginning and 45.0MB in the end (delta: 39.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.02ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 53.6MB in the beginning and 85.8MB in the end (delta: -32.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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/memsafety-ext2/complex_data_creation_test01-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 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:38:57,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:38:57,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:38:58,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:38:58,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:38:58,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:38:58,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:38:58,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:38:58,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:38:58,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:38:58,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:38:58,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:38:58,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:38:58,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:38:58,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:38:58,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:38:58,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:38:58,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:38:58,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:38:58,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:38:58,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:38:58,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:38:58,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:38:58,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:38:58,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:38:58,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:38:58,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:38:58,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:38:58,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:38:58,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:38:58,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:38:58,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:38:58,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:38:58,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:38:58,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:38:58,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:38:58,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:38:58,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:38:58,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:38:58,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:38:58,056 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:38:58,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:38:58,087 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:38:58,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:38:58,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:38:58,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:38:58,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:38:58,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:38:58,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:38:58,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:38:58,091 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:38:58,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:38:58,092 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:38:58,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:38:58,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:38:58,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:38:58,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:38:58,093 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:38:58,093 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:38:58,093 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:38:58,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:38:58,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:38:58,094 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:38:58,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:38:58,094 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:38:58,094 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:38:58,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:38:58,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:38:58,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:38:58,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:38:58,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:38:58,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:38:58,096 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:38:58,096 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:38:58,096 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:38:58,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:38:58,097 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2021-12-14 19:38:58,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:38:58,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:38:58,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:38:58,417 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:38:58,418 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:38:58,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2021-12-14 19:38:58,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9122d5bd2/f4552ac9ef4e4a4e9060ec8ae639cf18/FLAG69f81063e [2021-12-14 19:38:58,961 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:38:58,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2021-12-14 19:38:58,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9122d5bd2/f4552ac9ef4e4a4e9060ec8ae639cf18/FLAG69f81063e [2021-12-14 19:38:59,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9122d5bd2/f4552ac9ef4e4a4e9060ec8ae639cf18 [2021-12-14 19:38:59,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:38:59,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:38:59,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:59,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:38:59,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:38:59,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@575d42d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59, skipping insertion in model container [2021-12-14 19:38:59,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:38:59,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:38:59,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:38:59,589 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-14 19:38:59,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:38:59,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:38:59,630 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:38:59,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:38:59,689 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:38:59,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59 WrapperNode [2021-12-14 19:38:59,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:59,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:38:59,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:38:59,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:38:59,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,765 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2021-12-14 19:38:59,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:38:59,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:38:59,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:38:59,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:38:59,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:38:59,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:38:59,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:38:59,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:38:59,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (1/1) ... [2021-12-14 19:38:59,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:38:59,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:38:59,864 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-14 19:38:59,879 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-14 19:38:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:38:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:38:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2021-12-14 19:38:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2021-12-14 19:38:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:38:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:38:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:38:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:38:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:38:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:38:59,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:38:59,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:38:59,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:38:59,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:39:00,026 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:39:00,043 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:39:00,788 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:39:00,796 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:39:00,797 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 19:39:00,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:00 BoogieIcfgContainer [2021-12-14 19:39:00,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:39:00,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:39:00,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:39:00,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:39:00,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:38:59" (1/3) ... [2021-12-14 19:39:00,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f80f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:00, skipping insertion in model container [2021-12-14 19:39:00,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:59" (2/3) ... [2021-12-14 19:39:00,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f80f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:00, skipping insertion in model container [2021-12-14 19:39:00,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:00" (3/3) ... [2021-12-14 19:39:00,811 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2021-12-14 19:39:00,816 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:39:00,816 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2021-12-14 19:39:00,844 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:39:00,850 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-14 19:39:00,850 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2021-12-14 19:39:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:00,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:00,868 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:00,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:00,869 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:00,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2021-12-14 19:39:00,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:00,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228230956] [2021-12-14 19:39:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:00,883 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:00,885 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-14 19:39:00,892 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-14 19:39:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:00,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:00,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:01,048 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-14 19:39:01,117 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:01,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2021-12-14 19:39:01,147 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-14 19:39:01,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:01,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:01,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228230956] [2021-12-14 19:39:01,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228230956] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:01,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:01,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:01,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183167203] [2021-12-14 19:39:01,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:01,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:01,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:01,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:01,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:01,180 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-14 19:39:01,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:01,495 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2021-12-14 19:39:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:01,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2021-12-14 19:39:01,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:01,505 INFO L225 Difference]: With dead ends: 183 [2021-12-14 19:39:01,505 INFO L226 Difference]: Without dead ends: 181 [2021-12-14 19:39:01,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 19:39:01,511 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:01,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 332 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 97 Unchecked, 0.3s Time] [2021-12-14 19:39:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-14 19:39:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-14 19:39:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 91 states have (on average 2.065934065934066) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2021-12-14 19:39:01,574 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2021-12-14 19:39:01,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:01,575 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2021-12-14 19:39:01,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-14 19:39:01,575 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2021-12-14 19:39:01,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:01,576 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:01,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:01,590 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-14 19:39:01,784 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-14 19:39:01,785 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:01,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2021-12-14 19:39:01,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:01,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611482619] [2021-12-14 19:39:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:01,792 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:01,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:01,794 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-14 19:39:01,796 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-14 19:39:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:01,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:01,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:01,874 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-14 19:39:01,883 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-14 19:39:01,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:01,937 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-14 19:39:01,949 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:01,949 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 18 treesize of output 18 [2021-12-14 19:39:01,967 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-14 19:39:01,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:01,968 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:01,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611482619] [2021-12-14 19:39:01,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611482619] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:01,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:01,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:01,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74812474] [2021-12-14 19:39:01,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:01,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:01,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:01,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:01,980 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-14 19:39:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:02,528 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2021-12-14 19:39:02,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4 [2021-12-14 19:39:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:02,531 INFO L225 Difference]: With dead ends: 198 [2021-12-14 19:39:02,532 INFO L226 Difference]: Without dead ends: 198 [2021-12-14 19:39:02,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-14 19:39:02,533 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:02,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 341 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:39:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-14 19:39:02,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2021-12-14 19:39:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 96 states have (on average 2.0416666666666665) internal successors, (196), 182 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2021-12-14 19:39:02,544 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 4 [2021-12-14 19:39:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:02,544 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2021-12-14 19:39:02,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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-14 19:39:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2021-12-14 19:39:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:02,545 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:02,545 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:02,558 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-14 19:39:02,754 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-14 19:39:02,754 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:02,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2021-12-14 19:39:02,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:02,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206946702] [2021-12-14 19:39:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:02,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:02,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:02,757 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-14 19:39:02,759 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-14 19:39:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:02,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:02,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:02,833 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-14 19:39:02,840 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-14 19:39:02,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:02,841 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:02,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206946702] [2021-12-14 19:39:02,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206946702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:02,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:02,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:02,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551482343] [2021-12-14 19:39:02,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:02,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:02,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:02,843 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:03,121 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2021-12-14 19:39:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-14 19:39:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:03,125 INFO L225 Difference]: With dead ends: 209 [2021-12-14 19:39:03,125 INFO L226 Difference]: Without dead ends: 209 [2021-12-14 19:39:03,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:03,126 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:03,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 230 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-14 19:39:03,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2021-12-14 19:39:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 96 states have (on average 2.0104166666666665) internal successors, (193), 180 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2021-12-14 19:39:03,136 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 5 [2021-12-14 19:39:03,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:03,137 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2021-12-14 19:39:03,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2021-12-14 19:39:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:03,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:03,138 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:03,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:03,345 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-14 19:39:03,345 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2021-12-14 19:39:03,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:03,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325405863] [2021-12-14 19:39:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:03,346 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:03,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:03,348 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-14 19:39:03,350 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-14 19:39:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:03,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:03,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:03,405 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-14 19:39:03,418 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-14 19:39:03,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:03,419 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:03,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325405863] [2021-12-14 19:39:03,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325405863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:03,419 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:03,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:03,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71271739] [2021-12-14 19:39:03,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:03,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:03,420 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:03,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:03,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:03,421 INFO L87 Difference]: Start difference. First operand 184 states and 197 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:03,722 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2021-12-14 19:39:03,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:03,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-14 19:39:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:03,724 INFO L225 Difference]: With dead ends: 182 [2021-12-14 19:39:03,724 INFO L226 Difference]: Without dead ends: 182 [2021-12-14 19:39:03,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:03,725 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:03,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 272 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-14 19:39:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-14 19:39:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 96 states have (on average 1.9791666666666667) internal successors, (190), 178 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2021-12-14 19:39:03,733 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 5 [2021-12-14 19:39:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:03,733 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2021-12-14 19:39:03,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:03,734 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2021-12-14 19:39:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:39:03,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:03,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:03,743 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-14 19:39:03,943 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-14 19:39:03,943 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:03,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1983189561, now seen corresponding path program 1 times [2021-12-14 19:39:03,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:03,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666729332] [2021-12-14 19:39:03,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:03,944 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:03,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:03,945 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-14 19:39:03,947 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-14 19:39:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:03,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:03,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:04,012 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-14 19:39:04,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:04,013 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:04,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666729332] [2021-12-14 19:39:04,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666729332] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:04,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:04,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:04,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016012539] [2021-12-14 19:39:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:04,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:04,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:04,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:04,016 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:04,257 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2021-12-14 19:39:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:04,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-14 19:39:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:04,258 INFO L225 Difference]: With dead ends: 206 [2021-12-14 19:39:04,259 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 19:39:04,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 19:39:04,260 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 54 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:04,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 236 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 19:39:04,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2021-12-14 19:39:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2021-12-14 19:39:04,267 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 7 [2021-12-14 19:39:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:04,267 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2021-12-14 19:39:04,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2021-12-14 19:39:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:39:04,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:04,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:04,279 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-14 19:39:04,478 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-14 19:39:04,479 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2021-12-14 19:39:04,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:04,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816884424] [2021-12-14 19:39:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:04,480 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:04,481 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-14 19:39:04,482 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-14 19:39:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:04,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:39:04,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:04,571 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-14 19:39:04,605 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:04,605 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 17 treesize of output 17 [2021-12-14 19:39:04,654 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 14 treesize of output 16 [2021-12-14 19:39:04,660 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 14 treesize of output 16 [2021-12-14 19:39:04,694 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 15 treesize of output 7 [2021-12-14 19:39:04,703 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 15 treesize of output 7 [2021-12-14 19:39:04,723 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-14 19:39:04,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:04,724 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:04,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816884424] [2021-12-14 19:39:04,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816884424] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:04,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:04,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:39:04,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510021743] [2021-12-14 19:39:04,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:04,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:04,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:04,726 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 19:39:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:05,205 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2021-12-14 19:39:05,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:05,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-14 19:39:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:05,207 INFO L225 Difference]: With dead ends: 183 [2021-12-14 19:39:05,207 INFO L226 Difference]: Without dead ends: 183 [2021-12-14 19:39:05,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:05,208 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:05,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 743 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:39:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-14 19:39:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2021-12-14 19:39:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2021-12-14 19:39:05,213 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2021-12-14 19:39:05,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:05,214 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2021-12-14 19:39:05,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-14 19:39:05,214 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2021-12-14 19:39:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:39:05,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:05,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:05,225 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-14 19:39:05,423 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-14 19:39:05,424 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:05,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2021-12-14 19:39:05,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:05,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124847389] [2021-12-14 19:39:05,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:05,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:05,426 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-14 19:39:05,429 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-14 19:39:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:05,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:39:05,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:05,522 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-14 19:39:05,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:05,522 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:05,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124847389] [2021-12-14 19:39:05,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124847389] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:05,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:05,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:05,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714274745] [2021-12-14 19:39:05,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:05,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:05,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:05,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:05,524 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:05,549 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2021-12-14 19:39:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:05,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-14 19:39:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:05,550 INFO L225 Difference]: With dead ends: 258 [2021-12-14 19:39:05,551 INFO L226 Difference]: Without dead ends: 258 [2021-12-14 19:39:05,551 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-14 19:39:05,552 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:05,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-14 19:39:05,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2021-12-14 19:39:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2021-12-14 19:39:05,557 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2021-12-14 19:39:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:05,558 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2021-12-14 19:39:05,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2021-12-14 19:39:05,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:05,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:05,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:05,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:05,767 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-14 19:39:05,767 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:05,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2021-12-14 19:39:05,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:05,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827770175] [2021-12-14 19:39:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:05,769 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:05,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:05,769 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-14 19:39:05,770 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-14 19:39:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:05,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:39:05,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:05,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:05,886 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:05,887 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 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-14 19:39:05,910 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-14 19:39:05,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:05,910 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827770175] [2021-12-14 19:39:05,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827770175] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:05,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:05,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:05,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397775220] [2021-12-14 19:39:05,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:05,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:05,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:05,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:05,912 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:05,915 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2021-12-14 19:39:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:05,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 19:39:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:05,917 INFO L225 Difference]: With dead ends: 221 [2021-12-14 19:39:05,917 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 19:39:05,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:05,918 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:05,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 101 Unchecked, 0.0s Time] [2021-12-14 19:39:05,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 19:39:05,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-12-14 19:39:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 136 states have (on average 1.963235294117647) internal successors, (267), 216 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 271 transitions. [2021-12-14 19:39:05,925 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 271 transitions. Word has length 13 [2021-12-14 19:39:05,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:05,925 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 271 transitions. [2021-12-14 19:39:05,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 271 transitions. [2021-12-14 19:39:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:05,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:05,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:05,934 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-14 19:39:06,134 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-14 19:39:06,134 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2021-12-14 19:39:06,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:06,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862631668] [2021-12-14 19:39:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:06,135 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:06,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:06,137 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-14 19:39:06,141 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-14 19:39:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:06,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:39:06,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:06,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:06,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 19:39:06,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:39:06,276 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-14 19:39:06,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:06,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:06,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862631668] [2021-12-14 19:39:06,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862631668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:06,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:06,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:06,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181046102] [2021-12-14 19:39:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:06,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:06,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:06,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:06,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:06,279 INFO L87 Difference]: Start difference. First operand 221 states and 271 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:06,548 INFO L93 Difference]: Finished difference Result 208 states and 243 transitions. [2021-12-14 19:39:06,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 19:39:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:06,550 INFO L225 Difference]: With dead ends: 208 [2021-12-14 19:39:06,550 INFO L226 Difference]: Without dead ends: 208 [2021-12-14 19:39:06,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:06,551 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 59 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:06,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 198 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-14 19:39:06,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2021-12-14 19:39:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 136 states have (on average 1.7426470588235294) internal successors, (237), 201 states have internal predecessors, (237), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:06,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 241 transitions. [2021-12-14 19:39:06,555 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 241 transitions. Word has length 13 [2021-12-14 19:39:06,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:06,555 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 241 transitions. [2021-12-14 19:39:06,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:06,556 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 241 transitions. [2021-12-14 19:39:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:06,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:06,556 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:06,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:06,756 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-14 19:39:06,757 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1465867550, now seen corresponding path program 1 times [2021-12-14 19:39:06,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:06,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492334450] [2021-12-14 19:39:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:06,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:06,758 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-14 19:39:06,759 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-14 19:39:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:06,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:06,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:06,856 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-14 19:39:06,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:06,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:06,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492334450] [2021-12-14 19:39:06,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492334450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:06,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:06,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:06,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545499786] [2021-12-14 19:39:06,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:06,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:06,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:06,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:06,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:06,859 INFO L87 Difference]: Start difference. First operand 206 states and 241 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:06,895 INFO L93 Difference]: Finished difference Result 219 states and 257 transitions. [2021-12-14 19:39:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:06,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:39:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:06,897 INFO L225 Difference]: With dead ends: 219 [2021-12-14 19:39:06,897 INFO L226 Difference]: Without dead ends: 219 [2021-12-14 19:39:06,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:06,898 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:06,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 332 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:06,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-14 19:39:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2021-12-14 19:39:06,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 138 states have (on average 1.7318840579710144) internal successors, (239), 203 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 243 transitions. [2021-12-14 19:39:06,902 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 243 transitions. Word has length 16 [2021-12-14 19:39:06,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:06,903 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 243 transitions. [2021-12-14 19:39:06,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 243 transitions. [2021-12-14 19:39:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:06,903 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:06,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:06,915 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-14 19:39:07,115 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-14 19:39:07,116 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:07,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1465867600, now seen corresponding path program 1 times [2021-12-14 19:39:07,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:07,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909151406] [2021-12-14 19:39:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:07,117 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:07,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:07,118 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-14 19:39:07,119 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-14 19:39:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:07,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:07,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:07,219 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-14 19:39:07,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:07,220 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:07,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909151406] [2021-12-14 19:39:07,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909151406] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:07,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:07,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:07,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505437953] [2021-12-14 19:39:07,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:07,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:07,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:07,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:07,222 INFO L87 Difference]: Start difference. First operand 208 states and 243 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:07,422 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2021-12-14 19:39:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:07,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:39:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:07,424 INFO L225 Difference]: With dead ends: 196 [2021-12-14 19:39:07,424 INFO L226 Difference]: Without dead ends: 196 [2021-12-14 19:39:07,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:07,425 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:07,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 196 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-14 19:39:07,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2021-12-14 19:39:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 138 states have (on average 1.5289855072463767) internal successors, (211), 189 states have internal predecessors, (211), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 215 transitions. [2021-12-14 19:39:07,435 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 215 transitions. Word has length 16 [2021-12-14 19:39:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:07,435 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 215 transitions. [2021-12-14 19:39:07,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2021-12-14 19:39:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:07,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:07,436 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:07,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:07,644 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-14 19:39:07,645 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2021-12-14 19:39:07,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383660662] [2021-12-14 19:39:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:07,646 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:07,647 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-14 19:39:07,649 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-14 19:39:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:07,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:07,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:07,764 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:39:07,765 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 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-14 19:39:07,785 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-14 19:39:07,810 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 26 treesize of output 14 [2021-12-14 19:39:07,826 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-14 19:39:07,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:07,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:07,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383660662] [2021-12-14 19:39:07,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383660662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:07,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:07,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:07,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946365481] [2021-12-14 19:39:07,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:07,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:39:07,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:07,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:39:07,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:39:07,829 INFO L87 Difference]: Start difference. First operand 194 states and 215 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:08,221 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2021-12-14 19:39:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-14 19:39:08,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:08,223 INFO L225 Difference]: With dead ends: 199 [2021-12-14 19:39:08,223 INFO L226 Difference]: Without dead ends: 199 [2021-12-14 19:39:08,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-14 19:39:08,224 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:08,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 402 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:39:08,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-14 19:39:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2021-12-14 19:39:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.528169014084507) internal successors, (217), 193 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:08,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 221 transitions. [2021-12-14 19:39:08,228 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 221 transitions. Word has length 17 [2021-12-14 19:39:08,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:08,229 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 221 transitions. [2021-12-14 19:39:08,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:08,229 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 221 transitions. [2021-12-14 19:39:08,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:08,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:08,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:08,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-14 19:39:08,438 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-14 19:39:08,438 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:08,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:08,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2021-12-14 19:39:08,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:08,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333397643] [2021-12-14 19:39:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:08,439 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:08,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:08,440 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-14 19:39:08,441 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-14 19:39:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:08,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:39:08,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:08,550 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:08,550 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:08,572 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-14 19:39:08,579 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-14 19:39:08,642 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-14 19:39:08,646 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-14 19:39:08,664 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-14 19:39:08,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:08,664 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:08,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333397643] [2021-12-14 19:39:08,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333397643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:08,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:08,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:39:08,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153517581] [2021-12-14 19:39:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:08,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:08,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:08,666 INFO L87 Difference]: Start difference. First operand 198 states and 221 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:09,181 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2021-12-14 19:39:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-14 19:39:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:09,183 INFO L225 Difference]: With dead ends: 200 [2021-12-14 19:39:09,183 INFO L226 Difference]: Without dead ends: 200 [2021-12-14 19:39:09,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:09,184 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 5 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:09,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 404 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:39:09,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-14 19:39:09,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2021-12-14 19:39:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2021-12-14 19:39:09,188 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 17 [2021-12-14 19:39:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:09,188 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2021-12-14 19:39:09,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2021-12-14 19:39:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:09,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:09,189 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:09,198 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-14 19:39:09,397 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-14 19:39:09,398 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:09,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:09,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2021-12-14 19:39:09,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:09,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127863460] [2021-12-14 19:39:09,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:09,399 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:09,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:09,400 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-14 19:39:09,402 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-14 19:39:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:09,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:09,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:09,551 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:09,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-14 19:39:09,595 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-14 19:39:09,668 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:09,669 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 37 treesize of output 38 [2021-12-14 19:39:09,700 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 34 treesize of output 16 [2021-12-14 19:39:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:39:09,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:09,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_228) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))))))))) is different from false [2021-12-14 19:39:09,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_228) c_create_data_~data~0.base) .cse0)))))) (_ bv1 1)))) is different from false [2021-12-14 19:39:09,778 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:09,779 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2021-12-14 19:39:09,781 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 52 treesize of output 40 [2021-12-14 19:39:09,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-14 19:39:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-14 19:39:09,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:09,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127863460] [2021-12-14 19:39:09,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127863460] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:09,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:09,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-12-14 19:39:09,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127915886] [2021-12-14 19:39:09,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:09,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:39:09,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:09,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:39:09,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=40, Unknown=2, NotChecked=26, Total=90 [2021-12-14 19:39:09,868 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:10,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:10,450 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2021-12-14 19:39:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:39:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:10,452 INFO L225 Difference]: With dead ends: 203 [2021-12-14 19:39:10,452 INFO L226 Difference]: Without dead ends: 203 [2021-12-14 19:39:10,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=50, Unknown=2, NotChecked=30, Total=110 [2021-12-14 19:39:10,453 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 26 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:10,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 654 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 297 Invalid, 0 Unknown, 260 Unchecked, 0.5s Time] [2021-12-14 19:39:10,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-14 19:39:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2021-12-14 19:39:10,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2021-12-14 19:39:10,457 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 22 [2021-12-14 19:39:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:10,457 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2021-12-14 19:39:10,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2021-12-14 19:39:10,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:10,458 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:10,458 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:10,471 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-14 19:39:10,667 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-14 19:39:10,668 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2021-12-14 19:39:10,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:10,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908116484] [2021-12-14 19:39:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:10,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:10,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:10,669 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-14 19:39:10,672 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-14 19:39:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:10,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:39:10,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:10,848 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:10,848 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:10,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:39:10,905 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-14 19:39:10,915 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-14 19:39:11,051 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:11,052 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-14 19:39:11,058 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-14 19:39:11,143 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-14 19:39:11,150 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-14 19:39:11,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:11,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:11,564 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_272) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_272) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_273) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:11,601 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_272) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_272) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_273) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:11,651 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_272) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_273) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3) v_ArrVal_272) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-14 19:39:11,666 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:11,666 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2021-12-14 19:39:11,669 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 54 treesize of output 36 [2021-12-14 19:39:11,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-14 19:39:11,689 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:11,690 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-14 19:39:11,699 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:11,699 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-14 19:39:11,701 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:11,704 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 33 treesize of output 21 [2021-12-14 19:39:11,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:11,709 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 24 treesize of output 12 [2021-12-14 19:39:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-14 19:39:11,788 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:11,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908116484] [2021-12-14 19:39:11,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908116484] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:11,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:11,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 19:39:11,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469495288] [2021-12-14 19:39:11,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:11,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 19:39:11,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:11,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 19:39:11,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2021-12-14 19:39:11,790 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:13,758 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2021-12-14 19:39:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:39:13,759 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-14 19:39:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:13,760 INFO L225 Difference]: With dead ends: 209 [2021-12-14 19:39:13,760 INFO L226 Difference]: Without dead ends: 209 [2021-12-14 19:39:13,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2021-12-14 19:39:13,761 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 15 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:13,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 885 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 235 Unchecked, 1.7s Time] [2021-12-14 19:39:13,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-14 19:39:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2021-12-14 19:39:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2021-12-14 19:39:13,765 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 22 [2021-12-14 19:39:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:13,765 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2021-12-14 19:39:13,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2021-12-14 19:39:13,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:39:13,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:13,766 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:13,783 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-14 19:39:13,966 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-14 19:39:13,966 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:13,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2021-12-14 19:39:13,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:13,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527434106] [2021-12-14 19:39:13,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:39:13,967 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:13,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:13,968 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-14 19:39:13,970 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-14 19:39:14,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:39:14,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:14,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 19:39:14,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:14,178 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:14,179 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:14,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:39:14,221 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-14 19:39:14,231 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-14 19:39:14,355 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:14,356 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-14 19:39:14,361 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-14 19:39:14,514 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:14,514 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-14 19:39:14,518 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-14 19:39:14,600 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-14 19:39:14,604 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-14 19:39:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:14,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:14,987 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_334) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_335) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_334) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2021-12-14 19:39:15,020 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_334) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_334) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_335) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:15,074 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_334) c_create_data_~data~0.base) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_335) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_334) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-14 19:39:15,144 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_333)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_332) .cse0 v_ArrVal_334) c_create_data_~data~0.base) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_335) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_332) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_333) c_create_data_~data~0.base) .cse5) v_ArrVal_334) c_create_data_~data~0.base) .cse5)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:15,318 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_332) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_333) c_create_data_~data~0.base) .cse3) v_ArrVal_334)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_333))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_332) .cse5 v_ArrVal_334) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_335) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:15,376 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_333))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_332) .cse1 v_ArrVal_334) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_335) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_332) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_333) c_create_data_~data~0.base) .cse6) v_ArrVal_334)) c_create_data_~data~0.base) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:15,390 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:15,390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2021-12-14 19:39:15,398 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:15,398 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2021-12-14 19:39:15,402 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 400 treesize of output 334 [2021-12-14 19:39:15,410 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 688 treesize of output 634 [2021-12-14 19:39:15,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 630 treesize of output 582 [2021-12-14 19:39:15,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 582 treesize of output 566 [2021-12-14 19:39:15,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 566 treesize of output 462 [2021-12-14 19:39:15,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 462 treesize of output 414 [2021-12-14 19:39:20,963 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,963 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2021-12-14 19:39:20,971 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,971 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2021-12-14 19:39:20,991 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 102 treesize of output 84 [2021-12-14 19:39:20,994 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 286 treesize of output 244 [2021-12-14 19:39:21,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 200 [2021-12-14 19:39:21,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 146 [2021-12-14 19:39:21,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 130 [2021-12-14 19:39:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-14 19:39:21,521 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:21,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527434106] [2021-12-14 19:39:21,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527434106] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:21,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:21,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2021-12-14 19:39:21,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125126099] [2021-12-14 19:39:21,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:21,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:39:21,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:39:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2021-12-14 19:39:21,524 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:23,797 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2021-12-14 19:39:23,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:39:23,798 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-14 19:39:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:23,799 INFO L225 Difference]: With dead ends: 219 [2021-12-14 19:39:23,799 INFO L226 Difference]: Without dead ends: 219 [2021-12-14 19:39:23,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2021-12-14 19:39:23,800 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 20 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 593 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:23,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 1291 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 570 Invalid, 0 Unknown, 593 Unchecked, 1.9s Time] [2021-12-14 19:39:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-14 19:39:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2021-12-14 19:39:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2021-12-14 19:39:23,805 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 27 [2021-12-14 19:39:23,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:23,805 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2021-12-14 19:39:23,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2021-12-14 19:39:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:39:23,806 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:23,806 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:23,817 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-14 19:39:24,017 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-14 19:39:24,017 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2021-12-14 19:39:24,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:24,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793139790] [2021-12-14 19:39:24,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:24,018 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:24,019 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-14 19:39:24,024 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-14 19:39:24,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:24,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:24,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:39:24,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:24,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-14 19:39:24,368 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 19:39:24,383 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-14 19:39:24,389 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-14 19:39:24,485 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:24,485 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-14 19:39:24,490 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-14 19:39:24,597 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:24,598 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-14 19:39:24,602 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-14 19:39:24,721 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:24,721 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-14 19:39:24,726 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-14 19:39:24,807 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-14 19:39:24,811 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-14 19:39:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:24,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:25,173 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_413) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_413) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:25,213 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_413) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_413) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_414) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:25,264 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_413) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_413) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_414) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:25,323 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_411) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_412) c_create_data_~data~0.base) .cse2) v_ArrVal_413) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_412)) (.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_411) .cse3 v_ArrVal_413) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_414) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:25,491 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_412))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_411) .cse1 v_ArrVal_413) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_411) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_412) c_create_data_~data~0.base) .cse7) v_ArrVal_413)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-14 19:39:25,559 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_412))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_411) .cse1 v_ArrVal_413) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_411) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_412) c_create_data_~data~0.base) .cse7) v_ArrVal_413)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse5))))) is different from false [2021-12-14 19:39:25,799 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_409)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_412))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_410) .cse0 v_ArrVal_411) .cse1 v_ArrVal_413) c_create_data_~data~0.base) .cse2) (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_409))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_410) .cse7 v_ArrVal_411) (select (select (store .cse8 .cse7 v_ArrVal_412) c_create_data_~data~0.base) .cse9) v_ArrVal_413))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd .cse5 (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:27,548 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_409))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_412))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) .cse1 v_ArrVal_411) .cse2 v_ArrVal_413) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_414) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse7 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_409))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_410) .cse9 v_ArrVal_411) (select (select (store .cse10 .cse9 v_ArrVal_412) c_create_data_~data~0.base) .cse11) v_ArrVal_413)))) c_create_data_~data~0.base) .cse11)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2021-12-14 19:39:27,691 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_409))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_412))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) .cse1 v_ArrVal_411) .cse2 v_ArrVal_413) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_414) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_409))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_410) .cse8 v_ArrVal_411) (select (select (store .cse9 .cse8 v_ArrVal_412) c_create_data_~data~0.base) .cse10) v_ArrVal_413)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:27,743 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:27,744 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2021-12-14 19:39:27,783 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:27,783 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2021-12-14 19:39:27,801 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 9240 treesize of output 7818 [2021-12-14 19:39:27,969 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 34052 treesize of output 32894 [2021-12-14 19:39:28,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32890 treesize of output 30650 [2021-12-14 19:39:28,297 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30650 treesize of output 28410 [2021-12-14 19:39:28,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28410 treesize of output 27898 [2021-12-14 19:39:28,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27898 treesize of output 25146 [2021-12-14 19:39:28,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25146 treesize of output 24186 [2021-12-14 19:39:28,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24186 treesize of output 19914 [2021-12-14 19:39:30,338 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:30,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793139790] [2021-12-14 19:39:30,338 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 19:39:30,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1961603611] [2021-12-14 19:39:30,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:30,339 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:30,340 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:39:30,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-14 19:39:30,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:30,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:30,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:39:30,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:30,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-14 19:39:30,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 19:39:30,853 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-14 19:39:30,887 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-14 19:39:31,114 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:31,115 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-14 19:39:31,126 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-14 19:39:31,424 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:31,425 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-14 19:39:31,438 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-14 19:39:31,742 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:31,742 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-14 19:39:31,756 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-14 19:39:31,962 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-14 19:39:31,974 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-14 19:39:31,995 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:31,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:32,258 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_493) c_create_data_~data~0.base) .cse0) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_492) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_493) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 (_ bv4 32) .cse2) (bvadd .cse1 (_ bv8 32) .cse2))))) is different from false [2021-12-14 19:39:32,330 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_493) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_493) c_create_data_~data~0.base) .cse4) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_492) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:32,445 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_493) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_492) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_493) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 (_ bv8 32) .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-14 19:39:32,560 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_491)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_490) .cse0 v_ArrVal_493) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_492) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_490) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_491) c_create_data_~data~0.base) .cse5) v_ArrVal_493) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse3 (_ bv8 32) .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:32,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_490) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_491) c_create_data_~data~0.base) .cse3) v_ArrVal_493)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_491))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_490) .cse5 v_ArrVal_493) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_492) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:32,962 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_491))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_490) .cse1 v_ArrVal_493) c_create_data_~data~0.base) .cse2) (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_492) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_490) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_491) c_create_data_~data~0.base) .cse7) v_ArrVal_493)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd .cse4 (_ bv16 32) .cse5))))) is different from false [2021-12-14 19:39:33,276 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_488))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_489) .cse2 v_ArrVal_490) (select (select (store .cse3 .cse2 v_ArrVal_491) c_create_data_~data~0.base) .cse4) v_ArrVal_493))) c_create_data_~data~0.base) .cse4))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_488)) (.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_491))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_489) .cse5 v_ArrVal_490) .cse6 v_ArrVal_493) c_create_data_~data~0.base) .cse7) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_492) c_create_data_~data~0.base) .cse7))))))))) is different from false [2021-12-14 19:39:35,445 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_488))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_489) .cse3 v_ArrVal_490) (select (select (store .cse4 .cse3 v_ArrVal_491) c_create_data_~data~0.base) .cse5) v_ArrVal_493)))) c_create_data_~data~0.base) .cse5)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_488))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_491))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_489) .cse7 v_ArrVal_490) .cse8 v_ArrVal_493) c_create_data_~data~0.base) .cse9)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_492) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-14 19:39:35,603 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_488))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_491))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_489) .cse1 v_ArrVal_490) .cse2 v_ArrVal_493) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_492) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_488))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_489) .cse8 v_ArrVal_490) (select (select (store .cse9 .cse8 v_ArrVal_491) c_create_data_~data~0.base) .cse10) v_ArrVal_493)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:35,652 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:35,652 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2021-12-14 19:39:35,679 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:35,679 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2021-12-14 19:39:35,693 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 1130 treesize of output 968 [2021-12-14 19:39:35,714 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 13084 treesize of output 12286 [2021-12-14 19:39:35,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12282 treesize of output 11418 [2021-12-14 19:39:35,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11418 treesize of output 11002 [2021-12-14 19:39:35,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11002 treesize of output 10018 [2021-12-14 19:39:35,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10018 treesize of output 8210 [2021-12-14 19:39:35,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8210 treesize of output 7698 [2021-12-14 19:39:37,800 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 19:39:37,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153878818] [2021-12-14 19:39:37,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:37,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:37,802 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:39:37,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-14 19:39:38,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:38,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:38,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:39:38,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:38,316 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:38,316 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:38,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:39:38,425 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-14 19:39:38,450 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-14 19:39:38,728 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:38,728 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-14 19:39:38,746 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-14 19:39:39,076 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:39,077 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-14 19:39:39,091 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-14 19:39:39,429 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:39,430 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-14 19:39:39,443 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-14 19:39:39,651 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-14 19:39:39,664 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-14 19:39:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:39,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:40,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_572) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_572) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_571) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:40,111 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_572) c_create_data_~data~0.base) .cse1) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_571) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_572) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 (_ bv4 32) .cse3) (bvadd .cse2 (_ bv8 32) .cse3))))) is different from false [2021-12-14 19:39:40,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_572) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_571) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_572) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 (_ bv8 32) .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-14 19:39:40,395 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_570)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_569) .cse0 v_ArrVal_572) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_571) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_569) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_570) c_create_data_~data~0.base) .cse5) v_ArrVal_572) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:40,488 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_569) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_570) c_create_data_~data~0.base) .cse3) v_ArrVal_572)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_570))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_569) .cse5 v_ArrVal_572) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_571) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:40,616 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_570))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_569) .cse1 v_ArrVal_572) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_571) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_569) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_570) c_create_data_~data~0.base) .cse7) v_ArrVal_572)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse5))))) is different from false [2021-12-14 19:39:40,744 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_568)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_570))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_567) .cse0 v_ArrVal_569) .cse1 v_ArrVal_572) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_571) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_568))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_567) .cse7 v_ArrVal_569) (select (select (store .cse8 .cse7 v_ArrVal_570) c_create_data_~data~0.base) .cse9) v_ArrVal_572))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false [2021-12-14 19:39:40,838 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_568))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_567) .cse3 v_ArrVal_569) (select (select (store .cse4 .cse3 v_ArrVal_570) c_create_data_~data~0.base) .cse5) v_ArrVal_572)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_568))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_570))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_567) .cse7 v_ArrVal_569) .cse8 v_ArrVal_572) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_571) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-14 19:39:40,987 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_568))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_570))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_567) .cse1 v_ArrVal_569) .cse2 v_ArrVal_572) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_571) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_568))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_567) .cse8 v_ArrVal_569) (select (select (store .cse9 .cse8 v_ArrVal_570) c_create_data_~data~0.base) .cse10) v_ArrVal_572)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:41,033 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:41,034 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2021-12-14 19:39:41,075 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:41,076 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2021-12-14 19:39:41,093 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 588 treesize of output 498 [2021-12-14 19:39:41,112 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 1766 treesize of output 1628 [2021-12-14 19:39:41,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1624 treesize of output 1512 [2021-12-14 19:39:41,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1512 treesize of output 1472 [2021-12-14 19:39:41,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1472 treesize of output 1240 [2021-12-14 19:39:41,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1240 treesize of output 1096 [2021-12-14 19:39:41,208 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1096 treesize of output 992 [2021-12-14 19:39:41,835 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:41,836 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2021-12-14 19:39:41,864 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:41,864 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2021-12-14 19:39:41,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:41,880 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 460 treesize of output 310 [2021-12-14 19:39:41,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:41,896 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 368 treesize of output 314 [2021-12-14 19:39:41,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 286 [2021-12-14 19:39:41,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 270 [2021-12-14 19:39:41,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 210 [2021-12-14 19:39:42,294 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2021-12-14 19:39:42,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153878818] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:42,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:42,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2021-12-14 19:39:42,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590930384] [2021-12-14 19:39:42,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:42,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-14 19:39:42,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 19:39:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=212, Unknown=27, NotChecked=1458, Total=1806 [2021-12-14 19:39:42,297 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:50,049 INFO L93 Difference]: Finished difference Result 229 states and 249 transitions. [2021-12-14 19:39:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:39:50,051 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 19:39:50,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:50,052 INFO L225 Difference]: With dead ends: 229 [2021-12-14 19:39:50,052 INFO L226 Difference]: Without dead ends: 229 [2021-12-14 19:39:50,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=146, Invalid=355, Unknown=27, NotChecked=1728, Total=2256 [2021-12-14 19:39:50,053 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 29 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 800 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:50,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 1542 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 708 Invalid, 0 Unknown, 800 Unchecked, 6.0s Time] [2021-12-14 19:39:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-14 19:39:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2021-12-14 19:39:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 222 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:50,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 247 transitions. [2021-12-14 19:39:50,057 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 247 transitions. Word has length 32 [2021-12-14 19:39:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:50,057 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 247 transitions. [2021-12-14 19:39:50,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 247 transitions. [2021-12-14 19:39:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:39:50,058 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:50,058 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:50,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:50,267 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-14 19:39:50,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-14 19:39:50,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:50,659 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times [2021-12-14 19:39:50,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989611768] [2021-12-14 19:39:50,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 19:39:50,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:50,661 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-14 19:39:50,661 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-14 19:39:50,847 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 19:39:50,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:50,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:39:50,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:50,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:39:50,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 19:39:51,054 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-14 19:39:51,083 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-14 19:39:51,638 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:51,638 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-14 19:39:51,653 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-14 19:39:52,186 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:52,187 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-14 19:39:52,199 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-14 19:39:52,780 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:52,780 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-14 19:39:52,793 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-14 19:39:53,394 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:53,395 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-14 19:39:53,410 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-14 19:39:53,839 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-14 19:39:53,852 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-14 19:39:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:53,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:54,862 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_667) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_667) c_create_data_~data~0.base) .cse2) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_668) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:54,938 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_667) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_667) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_668) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:55,074 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_667) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_668) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_667) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 (_ bv12 32) .cse3))))) is different from false [2021-12-14 19:39:55,196 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_666) c_create_data_~data~0.base) .cse2) v_ArrVal_667) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_666)) (.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_665) .cse3 v_ArrVal_667) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_668) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:55,483 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_666) c_create_data_~data~0.base) .cse3) v_ArrVal_667)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_666))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_665) .cse5 v_ArrVal_667) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_668) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:55,602 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_666))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_665) .cse1 v_ArrVal_667) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_668) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_666) c_create_data_~data~0.base) .cse7) v_ArrVal_667)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse5))))) is different from false [2021-12-14 19:39:55,850 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_663))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_664) .cse2 v_ArrVal_665) (select (select (store .cse3 .cse2 v_ArrVal_666) c_create_data_~data~0.base) .cse4) v_ArrVal_667))) c_create_data_~data~0.base) .cse4))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 (_ bv16 32) .cse1)))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_663)) (.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_666))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_664) .cse5 v_ArrVal_665) .cse6 v_ArrVal_667) c_create_data_~data~0.base) .cse7) (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_668) c_create_data_~data~0.base) .cse7))))))))) is different from false [2021-12-14 19:39:56,988 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_666))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) .cse2 v_ArrVal_667) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_668) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse7 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_663))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_664) .cse9 v_ArrVal_665) (select (select (store .cse10 .cse9 v_ArrVal_666) c_create_data_~data~0.base) .cse11) v_ArrVal_667)))) c_create_data_~data~0.base) .cse11)))) (bvule (bvadd .cse6 (_ bv12 32) .cse7) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2021-12-14 19:39:57,130 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_666))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) .cse2 v_ArrVal_667) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_668) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse7 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_663))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_664) .cse9 v_ArrVal_665) (select (select (store .cse10 .cse9 v_ArrVal_666) c_create_data_~data~0.base) .cse11) v_ArrVal_667)))) c_create_data_~data~0.base) .cse11)))) (bvule (bvadd (_ bv16 32) .cse6 .cse7) (bvadd .cse6 (_ bv20 32) .cse7))))) is different from false [2021-12-14 19:39:58,585 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_662)) (.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_666))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_661) .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) .cse2 v_ArrVal_667) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_668) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse12 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_662))) (let ((.cse9 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (let ((.cse11 (store .cse13 .cse9 v_ArrVal_663))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse12))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_661) .cse9 v_ArrVal_664) .cse10 v_ArrVal_665) (select (select (store .cse11 .cse10 v_ArrVal_666) c_create_data_~data~0.base) .cse12) v_ArrVal_667))))) c_create_data_~data~0.base) .cse12))) (.cse8 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse7 .cse8) (bvadd .cse7 .cse8 (_ bv20 32)))))) is different from false [2021-12-14 19:40:01,801 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_662))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_663))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_661) .cse3 v_ArrVal_664) .cse4 v_ArrVal_665) (select (select (store .cse5 .cse4 v_ArrVal_666) c_create_data_~data~0.base) .cse6) v_ArrVal_667)))))) c_create_data_~data~0.base) .cse6))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv20 32))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse12))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_662))) (let ((.cse9 (select (select .cse15 c_create_data_~data~0.base) .cse12))) (let ((.cse14 (store .cse15 .cse9 v_ArrVal_663))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse12))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_666))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_661) .cse9 v_ArrVal_664) .cse10 v_ArrVal_665) .cse11 v_ArrVal_667) c_create_data_~data~0.base) .cse12) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_668) c_create_data_~data~0.base) .cse12))))))))))))) is different from false