./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/optional_data_creation_test04-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:00:59,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:00:59,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:00:59,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:00:59,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:00:59,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:00:59,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:00:59,951 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:00:59,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:00:59,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:00:59,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:00:59,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:00:59,958 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:00:59,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:00:59,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:00:59,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:00:59,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:00:59,963 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:00:59,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:00:59,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:00:59,983 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:00:59,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:00:59,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:00:59,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:00:59,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:00:59,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:00:59,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:00:59,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:00:59,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:00:59,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:00:59,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:00:59,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:00:59,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:00:59,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:00:59,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:00:59,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:00:59,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:00:59,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:00:59,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:00:59,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:00:59,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:00:59,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:00:59,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:01:00,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:01:00,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:01:00,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:01:00,024 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:01:00,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:01:00,025 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:01:00,026 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:01:00,026 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:01:00,026 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:01:00,027 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:01:00,027 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:01:00,027 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:01:00,027 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:01:00,027 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:01:00,027 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:01:00,028 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:01:00,028 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:01:00,028 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:01:00,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:01:00,028 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:01:00,028 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:01:00,029 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:01:00,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:01:00,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:01:00,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:01:00,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:01:00,029 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:01:00,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:01:00,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:01:00,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:01:00,030 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2022-07-23 06:01:00,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:01:00,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:01:00,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:01:00,224 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:01:00,225 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:01:00,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-07-23 06:01:00,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45b0ebdd/d8919f45d9c24c288fc05547f4e9e69a/FLAG957adfc91 [2022-07-23 06:01:00,624 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:01:00,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-07-23 06:01:00,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45b0ebdd/d8919f45d9c24c288fc05547f4e9e69a/FLAG957adfc91 [2022-07-23 06:01:01,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e45b0ebdd/d8919f45d9c24c288fc05547f4e9e69a [2022-07-23 06:01:01,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:01:01,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:01:01,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:01,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:01:01,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:01:01,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:01" (1/1) ... [2022-07-23 06:01:01,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d0228ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:01, skipping insertion in model container [2022-07-23 06:01:01,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:01" (1/1) ... [2022-07-23 06:01:01,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:01:01,087 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:01:01,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:01,321 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-23 06:01:01,324 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2bdc17bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:01, skipping insertion in model container [2022-07-23 06:01:01,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:01,324 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 06:01:01,326 INFO L158 Benchmark]: Toolchain (without parser) took 290.85ms. Allocated memory is still 92.3MB. Free memory was 57.9MB in the beginning and 64.8MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 06:01:01,327 INFO L158 Benchmark]: CDTParser took 3.18ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 47.4MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:01:01,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.26ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 65.1MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 06:01:01,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.18ms. Allocated memory is still 92.3MB. Free memory was 47.4MB in the beginning and 47.4MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.26ms. Allocated memory is still 92.3MB. Free memory was 57.7MB in the beginning and 65.1MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 555]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 06:01:02,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:01:02,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:01:02,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:01:02,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:01:02,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:01:02,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:01:02,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:01:02,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:01:02,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:01:02,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:01:02,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:01:02,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:01:02,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:01:02,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:01:02,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:01:02,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:01:02,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:01:02,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:01:02,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:01:02,918 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:01:02,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:01:02,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:01:02,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:01:02,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:01:02,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:01:02,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:01:02,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:01:02,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:01:02,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:01:02,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:01:02,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:01:02,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:01:02,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:01:02,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:01:02,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:01:02,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:01:02,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:01:02,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:01:02,935 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:01:02,936 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:01:02,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:01:02,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:01:02,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:01:02,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:01:02,969 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:01:02,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:01:02,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:01:02,970 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:01:02,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:01:02,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:01:02,971 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:01:02,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:01:02,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:01:02,971 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:01:02,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:01:02,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:01:02,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:01:02,972 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:01:02,972 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:01:02,972 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:01:02,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:01:02,974 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:01:02,974 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:01:02,974 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:01:02,974 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:01:02,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:01:02,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:01:02,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:01:02,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:01:02,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:01:02,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:01:02,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:01:02,975 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:01:02,975 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:01:02,976 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:01:02,976 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2022-07-23 06:01:03,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:01:03,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:01:03,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:01:03,264 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:01:03,265 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:01:03,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-07-23 06:01:03,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a955f311/e4891969474645db904582349de736b6/FLAG6f69fead4 [2022-07-23 06:01:03,752 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:01:03,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2022-07-23 06:01:03,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a955f311/e4891969474645db904582349de736b6/FLAG6f69fead4 [2022-07-23 06:01:04,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a955f311/e4891969474645db904582349de736b6 [2022-07-23 06:01:04,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:01:04,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:01:04,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:04,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:01:04,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:01:04,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27029464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04, skipping insertion in model container [2022-07-23 06:01:04,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:01:04,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:01:04,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:04,450 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 06:01:04,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:01:04,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:04,489 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:01:04,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:01:04,533 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:01:04,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04 WrapperNode [2022-07-23 06:01:04,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:01:04,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:01:04,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:01:04,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:01:04,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,604 INFO L137 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 110 [2022-07-23 06:01:04,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:01:04,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:01:04,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:01:04,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:01:04,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:01:04,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:01:04,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:01:04,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:01:04,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (1/1) ... [2022-07-23 06:01:04,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:01:04,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:01:04,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 06:01:04,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 06:01:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:01:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:01:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 06:01:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:01:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:01:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:01:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 06:01:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 06:01:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 06:01:04,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:01:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:01:04,843 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:01:04,844 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:01:05,228 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:01:05,233 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:01:05,236 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 06:01:05,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:01:05 BoogieIcfgContainer [2022-07-23 06:01:05,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:01:05,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:01:05,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:01:05,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:01:05,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:01:04" (1/3) ... [2022-07-23 06:01:05,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518fb0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:01:05, skipping insertion in model container [2022-07-23 06:01:05,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:01:04" (2/3) ... [2022-07-23 06:01:05,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518fb0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:01:05, skipping insertion in model container [2022-07-23 06:01:05,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:01:05" (3/3) ... [2022-07-23 06:01:05,262 INFO L111 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2022-07-23 06:01:05,272 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:01:05,272 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-07-23 06:01:05,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:01:05,313 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62f36728, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50fc2007 [2022-07-23 06:01:05,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-07-23 06:01:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:01:05,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:05,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:01:05,322 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-07-23 06:01:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:05,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934377055] [2022-07-23 06:01:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:05,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:05,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:05,340 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:05,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 06:01:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:05,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:01:05,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:05,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:05,507 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:01:05,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:01:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:05,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:05,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:05,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934377055] [2022-07-23 06:01:05,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934377055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:05,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:05,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:01:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697260157] [2022-07-23 06:01:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:05,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:01:05,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:05,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:01:05,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:01:05,556 INFO L87 Difference]: Start difference. First operand has 98 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 97 states have internal predecessors, (107), 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) 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) [2022-07-23 06:01:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:05,834 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-07-23 06:01:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:01:05,838 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 [2022-07-23 06:01:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:05,845 INFO L225 Difference]: With dead ends: 148 [2022-07-23 06:01:05,845 INFO L226 Difference]: Without dead ends: 146 [2022-07-23 06:01:05,846 INFO L412 NwaCegarLoop]: 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 [2022-07-23 06:01:05,850 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 209 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:05,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 94 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-23 06:01:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 93. [2022-07-23 06:01:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 52 states have (on average 1.9230769230769231) internal successors, (100), 92 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-07-23 06:01:05,900 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 4 [2022-07-23 06:01:05,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:05,901 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-07-23 06:01:05,901 INFO L496 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) [2022-07-23 06:01:05,902 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-07-23 06:01:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-23 06:01:05,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:05,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-23 06:01:05,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:06,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:06,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:06,110 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-07-23 06:01:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:06,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819198004] [2022-07-23 06:01:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:06,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:06,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:06,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:06,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 06:01:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:06,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:01:06,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:06,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:06,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:06,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:01:06,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:01:06,223 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:06,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:01:06,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:06,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:06,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819198004] [2022-07-23 06:01:06,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819198004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:06,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:06,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:01:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938692079] [2022-07-23 06:01:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:06,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:01:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:06,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:01:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:01:06,255 INFO L87 Difference]: Start difference. First operand 93 states and 100 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) [2022-07-23 06:01:06,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:06,596 INFO L93 Difference]: Finished difference Result 236 states and 253 transitions. [2022-07-23 06:01:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:01:06,597 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 [2022-07-23 06:01:06,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:06,598 INFO L225 Difference]: With dead ends: 236 [2022-07-23 06:01:06,598 INFO L226 Difference]: Without dead ends: 236 [2022-07-23 06:01:06,599 INFO L412 NwaCegarLoop]: 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 [2022-07-23 06:01:06,599 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 235 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:06,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 97 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:01:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-23 06:01:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 107. [2022-07-23 06:01:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 106 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2022-07-23 06:01:06,618 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 4 [2022-07-23 06:01:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:06,618 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2022-07-23 06:01:06,618 INFO L496 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) [2022-07-23 06:01:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2022-07-23 06:01:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:01:06,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:06,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:01:06,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:06,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:06,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-07-23 06:01:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:06,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382556188] [2022-07-23 06:01:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:06,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:06,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:06,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 06:01:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:06,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:01:06,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:06,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:06,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:06,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:06,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382556188] [2022-07-23 06:01:06,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382556188] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:06,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:06,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328413227] [2022-07-23 06:01:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:06,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:06,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:06,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:06,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:06,872 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:07,005 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2022-07-23 06:01:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:07,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 06:01:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:07,006 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:01:07,007 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:01:07,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:07,008 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:07,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 87 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:01:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:01:07,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-07-23 06:01:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.7761194029850746) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-07-23 06:01:07,013 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 5 [2022-07-23 06:01:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:07,013 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-07-23 06:01:07,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-07-23 06:01:07,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-23 06:01:07,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:07,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-23 06:01:07,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:07,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:07,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:07,222 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-07-23 06:01:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:07,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364587520] [2022-07-23 06:01:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:07,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:07,223 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:07,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 06:01:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:07,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:01:07,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:07,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:07,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:07,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:07,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:07,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364587520] [2022-07-23 06:01:07,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364587520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:07,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:07,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:07,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500823939] [2022-07-23 06:01:07,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:07,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:07,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:07,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:07,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:07,281 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:07,455 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-07-23 06:01:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:07,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-23 06:01:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:07,456 INFO L225 Difference]: With dead ends: 180 [2022-07-23 06:01:07,456 INFO L226 Difference]: Without dead ends: 180 [2022-07-23 06:01:07,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:07,457 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 72 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:07,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-23 06:01:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 108. [2022-07-23 06:01:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.732394366197183) internal successors, (123), 107 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-07-23 06:01:07,464 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 5 [2022-07-23 06:01:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:07,464 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-07-23 06:01:07,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2022-07-23 06:01:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:01:07,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:07,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:07,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-23 06:01:07,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:07,672 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2022-07-23 06:01:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:07,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473094491] [2022-07-23 06:01:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:07,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:07,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:07,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:07,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 06:01:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:07,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:01:07,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:07,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:07,765 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 06:01:07,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-23 06:01:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:07,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:07,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:07,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473094491] [2022-07-23 06:01:07,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473094491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:07,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:07,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:01:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251491846] [2022-07-23 06:01:07,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:07,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:01:07,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:07,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:01:07,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:07,781 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:07,930 INFO L93 Difference]: Finished difference Result 151 states and 169 transitions. [2022-07-23 06:01:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:01:07,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-23 06:01:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:07,931 INFO L225 Difference]: With dead ends: 151 [2022-07-23 06:01:07,931 INFO L226 Difference]: Without dead ends: 151 [2022-07-23 06:01:07,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:01:07,932 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 69 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:07,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 144 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:01:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-23 06:01:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 104. [2022-07-23 06:01:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 103 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2022-07-23 06:01:07,936 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 9 [2022-07-23 06:01:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:07,936 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2022-07-23 06:01:07,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2022-07-23 06:01:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 06:01:07,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:07,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:07,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:08,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:08,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:08,144 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2022-07-23 06:01:08,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:08,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292205944] [2022-07-23 06:01:08,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:08,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:08,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:08,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:08,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 06:01:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:08,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:01:08,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:08,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:08,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:08,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:01:08,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:01:08,263 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:08,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:01:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:08,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:08,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:08,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292205944] [2022-07-23 06:01:08,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292205944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:08,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:08,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:01:08,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759344844] [2022-07-23 06:01:08,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:08,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:01:08,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:08,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:01:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:01:08,274 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:08,496 INFO L93 Difference]: Finished difference Result 200 states and 220 transitions. [2022-07-23 06:01:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:01:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-07-23 06:01:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:08,497 INFO L225 Difference]: With dead ends: 200 [2022-07-23 06:01:08,497 INFO L226 Difference]: Without dead ends: 200 [2022-07-23 06:01:08,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:01:08,498 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 183 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:08,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 166 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-23 06:01:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 100. [2022-07-23 06:01:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.591549295774648) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:08,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-23 06:01:08,501 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 9 [2022-07-23 06:01:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:08,501 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-23 06:01:08,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-23 06:01:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 06:01:08,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:08,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:08,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:08,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:08,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:08,711 INFO L85 PathProgramCache]: Analyzing trace with hash 184732728, now seen corresponding path program 1 times [2022-07-23 06:01:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:08,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099681094] [2022-07-23 06:01:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:08,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:08,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:08,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 06:01:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:08,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:01:08,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:08,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:08,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:08,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 06:01:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:08,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:08,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:08,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099681094] [2022-07-23 06:01:08,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099681094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:08,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:08,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:01:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213951042] [2022-07-23 06:01:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:08,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:08,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:08,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:08,827 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:09,058 INFO L93 Difference]: Finished difference Result 109 states and 123 transitions. [2022-07-23 06:01:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:01:09,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 06:01:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:09,059 INFO L225 Difference]: With dead ends: 109 [2022-07-23 06:01:09,059 INFO L226 Difference]: Without dead ends: 109 [2022-07-23 06:01:09,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:09,060 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:09,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 216 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-23 06:01:09,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2022-07-23 06:01:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-07-23 06:01:09,063 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 13 [2022-07-23 06:01:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:09,063 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-07-23 06:01:09,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-07-23 06:01:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 06:01:09,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:09,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:09,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:09,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:09,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:09,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash 184732729, now seen corresponding path program 1 times [2022-07-23 06:01:09,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:09,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653818798] [2022-07-23 06:01:09,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:09,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:09,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:09,278 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:09,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 06:01:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:09,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 06:01:09,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:09,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:09,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:09,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:09,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-23 06:01:09,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:01:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:09,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:09,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:09,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653818798] [2022-07-23 06:01:09,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653818798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:09,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:09,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:01:09,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147417599] [2022-07-23 06:01:09,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:09,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:01:09,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:09,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:01:09,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:01:09,462 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:09,720 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-07-23 06:01:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:01:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-23 06:01:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:09,721 INFO L225 Difference]: With dead ends: 104 [2022-07-23 06:01:09,721 INFO L226 Difference]: Without dead ends: 104 [2022-07-23 06:01:09,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:01:09,722 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:09,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 218 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:09,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-23 06:01:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2022-07-23 06:01:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 102 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-07-23 06:01:09,725 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 13 [2022-07-23 06:01:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:09,725 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-23 06:01:09,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-07-23 06:01:09,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 06:01:09,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:09,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:09,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:09,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:09,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:09,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1897191059, now seen corresponding path program 1 times [2022-07-23 06:01:09,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:09,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180879743] [2022-07-23 06:01:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:09,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:09,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:09,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 06:01:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:10,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 06:01:10,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:10,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:01:10,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 06:01:10,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:10,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-23 06:01:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:10,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:10,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:10,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180879743] [2022-07-23 06:01:10,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180879743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:10,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:10,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:01:10,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096101770] [2022-07-23 06:01:10,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:10,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:01:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:01:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:01:10,165 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:10,347 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-23 06:01:10,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:01:10,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 06:01:10,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:10,350 INFO L225 Difference]: With dead ends: 133 [2022-07-23 06:01:10,350 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 06:01:10,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:01:10,351 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 411 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:10,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 65 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:01:10,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 06:01:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2022-07-23 06:01:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-23 06:01:10,353 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2022-07-23 06:01:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:10,353 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-23 06:01:10,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-23 06:01:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:01:10,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:10,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:10,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:10,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:10,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:10,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -734113802, now seen corresponding path program 1 times [2022-07-23 06:01:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:10,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160215945] [2022-07-23 06:01:10,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:10,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:10,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:10,557 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:10,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 06:01:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:10,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:01:10,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:10,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:10,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 06:01:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:10,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:10,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:10,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160215945] [2022-07-23 06:01:10,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160215945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:10,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:10,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:01:10,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331253971] [2022-07-23 06:01:10,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:10,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:10,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:10,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:10,702 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:10,852 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-07-23 06:01:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:01:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-23 06:01:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:10,853 INFO L225 Difference]: With dead ends: 137 [2022-07-23 06:01:10,853 INFO L226 Difference]: Without dead ends: 137 [2022-07-23 06:01:10,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:10,854 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 164 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:10,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 174 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:01:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-23 06:01:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 98. [2022-07-23 06:01:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5714285714285714) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-07-23 06:01:10,856 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 17 [2022-07-23 06:01:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:10,862 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-07-23 06:01:10,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-07-23 06:01:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:01:10,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:10,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:10,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:11,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:11,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash -734113798, now seen corresponding path program 1 times [2022-07-23 06:01:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:11,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309862811] [2022-07-23 06:01:11,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:11,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:11,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:11,065 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:11,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 06:01:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:11,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:01:11,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:11,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:11,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:11,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 06:01:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:11,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:11,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:11,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309862811] [2022-07-23 06:01:11,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309862811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:11,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:11,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:01:11,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354842887] [2022-07-23 06:01:11,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:11,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:11,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:11,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:11,220 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:11,480 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-23 06:01:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:01:11,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-23 06:01:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:11,481 INFO L225 Difference]: With dead ends: 129 [2022-07-23 06:01:11,481 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 06:01:11,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:11,482 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:11,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 158 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 06:01:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 98. [2022-07-23 06:01:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 97 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:11,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2022-07-23 06:01:11,484 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 17 [2022-07-23 06:01:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:11,485 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2022-07-23 06:01:11,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2022-07-23 06:01:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 06:01:11,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:11,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:11,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:11,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:11,692 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:11,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -734113797, now seen corresponding path program 1 times [2022-07-23 06:01:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:11,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206260243] [2022-07-23 06:01:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:11,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:11,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:11,694 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:11,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 06:01:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:11,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:01:11,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:11,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:11,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:11,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:11,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 06:01:11,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:01:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:11,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:11,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:11,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206260243] [2022-07-23 06:01:11,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206260243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:11,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:11,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:01:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34573882] [2022-07-23 06:01:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:11,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:11,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:11,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:11,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:11,913 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:12,256 INFO L93 Difference]: Finished difference Result 201 states and 219 transitions. [2022-07-23 06:01:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:01:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2022-07-23 06:01:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:12,258 INFO L225 Difference]: With dead ends: 201 [2022-07-23 06:01:12,258 INFO L226 Difference]: Without dead ends: 201 [2022-07-23 06:01:12,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:12,260 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 148 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:12,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 221 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:01:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-23 06:01:12,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 106. [2022-07-23 06:01:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2022-07-23 06:01:12,263 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 17 [2022-07-23 06:01:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:12,263 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2022-07-23 06:01:12,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2022-07-23 06:01:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 06:01:12,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:12,263 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:12,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:12,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:12,471 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash 50233868, now seen corresponding path program 1 times [2022-07-23 06:01:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:12,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663872457] [2022-07-23 06:01:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:12,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:12,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:12,474 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:12,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 06:01:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:12,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:01:12,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:12,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:12,625 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:01:12,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:01:12,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:12,720 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:01:12,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-23 06:01:12,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 06:01:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 06:01:12,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:01:12,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-23 06:01:12,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-23 06:01:12,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:12,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-23 06:01:12,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-07-23 06:01:12,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 06:01:17,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:17,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663872457] [2022-07-23 06:01:17,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663872457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:01:17,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:01:17,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2022-07-23 06:01:17,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394885413] [2022-07-23 06:01:17,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:01:17,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:01:17,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:01:17,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=78, Unknown=3, NotChecked=38, Total=156 [2022-07-23 06:01:17,308 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:17,714 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-07-23 06:01:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:01:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 06:01:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:17,715 INFO L225 Difference]: With dead ends: 154 [2022-07-23 06:01:17,715 INFO L226 Difference]: Without dead ends: 154 [2022-07-23 06:01:17,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=45, Invalid=92, Unknown=3, NotChecked=42, Total=182 [2022-07-23 06:01:17,716 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 77 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:17,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 527 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 225 Invalid, 0 Unknown, 367 Unchecked, 0.3s Time] [2022-07-23 06:01:17,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-23 06:01:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 105. [2022-07-23 06:01:17,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.5) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-23 06:01:17,718 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 18 [2022-07-23 06:01:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:17,718 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-23 06:01:17,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-23 06:01:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 06:01:17,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:17,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:17,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:17,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:17,919 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 50233869, now seen corresponding path program 1 times [2022-07-23 06:01:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:17,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367569578] [2022-07-23 06:01:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:17,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:17,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:17,922 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:17,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 06:01:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:18,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:01:18,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:18,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:18,057 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:18,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:01:18,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:18,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:18,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:18,207 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:01:18,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 06:01:18,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:01:18,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 06:01:18,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:01:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:18,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:01:18,689 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse1 (_ bv4 32) .cse2) (bvadd .cse1 (_ bv8 32) .cse2))))) is different from false [2022-07-23 06:01:18,731 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) is different from false [2022-07-23 06:01:18,786 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_304) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_303 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_303) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-23 06:01:18,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:18,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-07-23 06:01:18,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2022-07-23 06:01:18,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-23 06:01:18,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:18,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-07-23 06:01:18,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:18,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-23 06:01:18,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:01:18,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-23 06:01:18,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:01:18,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-23 06:01:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 06:01:18,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:18,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367569578] [2022-07-23 06:01:18,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367569578] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:01:18,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:01:18,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2022-07-23 06:01:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838525169] [2022-07-23 06:01:18,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:01:18,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:01:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:18,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:01:18,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2022-07-23 06:01:18,916 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:21,502 INFO L93 Difference]: Finished difference Result 164 states and 179 transitions. [2022-07-23 06:01:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:01:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 06:01:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:21,504 INFO L225 Difference]: With dead ends: 164 [2022-07-23 06:01:21,504 INFO L226 Difference]: Without dead ends: 164 [2022-07-23 06:01:21,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=266, Unknown=3, NotChecked=108, Total=462 [2022-07-23 06:01:21,505 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:21,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 886 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 672 Invalid, 0 Unknown, 301 Unchecked, 1.7s Time] [2022-07-23 06:01:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-23 06:01:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2022-07-23 06:01:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-07-23 06:01:21,507 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 18 [2022-07-23 06:01:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:21,507 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-07-23 06:01:21,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-07-23 06:01:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:01:21,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:21,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:21,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:21,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:21,709 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:21,709 INFO L85 PathProgramCache]: Analyzing trace with hash -10622392, now seen corresponding path program 1 times [2022-07-23 06:01:21,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:21,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491236095] [2022-07-23 06:01:21,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:21,710 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:21,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:21,711 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:21,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 06:01:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:21,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:01:21,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:21,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:21,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:21,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 06:01:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:21,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:21,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:21,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491236095] [2022-07-23 06:01:21,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491236095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:21,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:21,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:01:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865600654] [2022-07-23 06:01:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:21,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:21,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:21,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:21,882 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:22,126 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-07-23 06:01:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:01:22,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 06:01:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:22,127 INFO L225 Difference]: With dead ends: 146 [2022-07-23 06:01:22,127 INFO L226 Difference]: Without dead ends: 146 [2022-07-23 06:01:22,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:22,128 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:22,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 160 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:01:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-23 06:01:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 110. [2022-07-23 06:01:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-07-23 06:01:22,130 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 20 [2022-07-23 06:01:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:22,130 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-07-23 06:01:22,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-07-23 06:01:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 06:01:22,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:22,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:22,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:22,338 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash -10622391, now seen corresponding path program 1 times [2022-07-23 06:01:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:22,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860235356] [2022-07-23 06:01:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:22,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:22,341 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:22,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-23 06:01:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:22,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 06:01:22,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:22,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:22,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:22,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:22,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:01:22,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 06:01:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:22,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:22,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:22,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860235356] [2022-07-23 06:01:22,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860235356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:22,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:22,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:01:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436869173] [2022-07-23 06:01:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:22,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:01:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:22,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:01:22,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:01:22,556 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:22,878 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2022-07-23 06:01:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:01:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-23 06:01:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:22,879 INFO L225 Difference]: With dead ends: 203 [2022-07-23 06:01:22,879 INFO L226 Difference]: Without dead ends: 203 [2022-07-23 06:01:22,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:01:22,880 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 164 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:22,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 187 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 06:01:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-23 06:01:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 113. [2022-07-23 06:01:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.441860465116279) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-07-23 06:01:22,888 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 20 [2022-07-23 06:01:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:22,888 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-07-23 06:01:22,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-07-23 06:01:22,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:01:22,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:22,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:22,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:23,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:23,096 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:23,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1375969503, now seen corresponding path program 1 times [2022-07-23 06:01:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:23,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324592174] [2022-07-23 06:01:23,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:01:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:23,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:23,098 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:23,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 06:01:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:01:23,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 06:01:23,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:23,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:23,203 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:23,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:01:23,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:23,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:01:23,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:01:23,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:01:23,441 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 06:01:23,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-23 06:01:23,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-23 06:01:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:23,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:01:23,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:01:23,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324592174] [2022-07-23 06:01:23,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324592174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:01:23,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:01:23,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:01:23,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579162137] [2022-07-23 06:01:23,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:01:23,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:01:23,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:01:23,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:01:23,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:01:23,481 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:01:24,214 INFO L93 Difference]: Finished difference Result 187 states and 198 transitions. [2022-07-23 06:01:24,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:01:24,215 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 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 23 [2022-07-23 06:01:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:01:24,216 INFO L225 Difference]: With dead ends: 187 [2022-07-23 06:01:24,216 INFO L226 Difference]: Without dead ends: 187 [2022-07-23 06:01:24,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:01:24,216 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 195 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:01:24,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 590 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 424 Invalid, 0 Unknown, 59 Unchecked, 0.5s Time] [2022-07-23 06:01:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-23 06:01:24,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 128. [2022-07-23 06:01:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.386138613861386) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-07-23 06:01:24,219 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 23 [2022-07-23 06:01:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:01:24,219 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-07-23 06:01:24,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:01:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-07-23 06:01:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-23 06:01:24,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:01:24,220 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:01:24,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 06:01:24,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:01:24,428 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:01:24,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:01:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash 382685369, now seen corresponding path program 2 times [2022-07-23 06:01:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:01:24,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089393842] [2022-07-23 06:01:24,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:01:24,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:01:24,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:01:24,430 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:01:24,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-23 06:01:24,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:01:24,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:01:24,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:01:24,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:01:24,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:24,627 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:01:24,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:01:24,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:01:24,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:24,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:01:24,761 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:01:24,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 06:01:24,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:01:24,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-07-23 06:01:24,906 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:01:24,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-07-23 06:01:24,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 06:01:24,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:01:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:01:25,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:01:25,401 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse4 (bvadd (_ bv4 32) .cse3 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (not (bvule (bvadd .cse3 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse4)) (not (bvule .cse4 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|)))))) is different from false [2022-07-23 06:01:25,798 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse5 (bvadd (_ bv8 32) .cse7 .cse8))) (or (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))))) (not (bvule .cse5 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))) (not (bvule (bvadd (_ bv4 32) .cse7 .cse8) .cse5)))))) is different from false [2022-07-23 06:01:32,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:32,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 152 [2022-07-23 06:01:32,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:01:32,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 86 [2022-07-23 06:01:32,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 730 treesize of output 610 [2022-07-23 06:01:32,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2320 treesize of output 2146 [2022-07-23 06:01:32,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2030 treesize of output 1870 [2022-07-23 06:01:32,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1667 treesize of output 1587 [2022-07-23 06:01:32,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1806 treesize of output 1646 [2022-07-23 06:01:32,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1716 treesize of output 1412 [2022-07-23 06:02:42,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:02:42,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 142 [2022-07-23 06:02:42,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:02:42,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2022-07-23 06:02:42,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 132 [2022-07-23 06:02:42,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 422 treesize of output 356 [2022-07-23 06:02:42,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 249 [2022-07-23 06:02:42,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 251 [2022-07-23 06:02:42,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 160 [2022-07-23 06:02:59,812 WARN L233 SmtUtils]: Spent 10.31s on a formula simplification. DAG size of input: 155 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:03:00,269 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:03:00,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 222 treesize of output 287 [2022-07-23 06:03:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-23 06:03:02,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:02,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089393842] [2022-07-23 06:03:02,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089393842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:03:02,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:03:02,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2022-07-23 06:03:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840176437] [2022-07-23 06:03:02,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:03:02,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 06:03:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 06:03:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=8, NotChecked=70, Total=420 [2022-07-23 06:03:02,694 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:09,138 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse9 (bvadd (_ bv8 32) .cse7 .cse8))) (let ((.cse0 (bvule .cse9 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10)))) (.cse6 (bvule (bvadd (_ bv4 32) .cse7 .cse8) .cse9))) (and .cse0 (or (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse2 (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (bvule (bvadd (_ bv8 32) .cse1 .cse2) (bvadd .cse1 .cse2 (_ bv12 32))))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))))))) (not .cse0) (not .cse6)) .cse6))))) is different from false [2022-07-23 06:03:09,322 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (let ((.cse9 (bvadd (_ bv4 32) .cse7 .cse8))) (let ((.cse0 (bvule .cse9 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10)))) (.cse1 (bvule (bvadd .cse7 .cse8) .cse9))) (and .cse0 (or (not .cse0) (not .cse1) (and (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_446) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse5 (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_447) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))) (bvule (bvadd (_ bv4 32) .cse4 .cse5) (bvadd (_ bv8 32) .cse4 .cse5)))))) .cse1))))) is different from false [2022-07-23 06:03:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:13,425 INFO L93 Difference]: Finished difference Result 182 states and 195 transitions. [2022-07-23 06:03:13,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 06:03:13,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 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 23 [2022-07-23 06:03:13,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:13,426 INFO L225 Difference]: With dead ends: 182 [2022-07-23 06:03:13,426 INFO L226 Difference]: Without dead ends: 182 [2022-07-23 06:03:13,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=200, Invalid=729, Unknown=17, NotChecked=244, Total=1190 [2022-07-23 06:03:13,427 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 110 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:13,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 652 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 385 Invalid, 0 Unknown, 574 Unchecked, 3.2s Time] [2022-07-23 06:03:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-07-23 06:03:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2022-07-23 06:03:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 116 states have (on average 1.353448275862069) internal successors, (157), 142 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2022-07-23 06:03:13,429 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 23 [2022-07-23 06:03:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:13,430 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2022-07-23 06:03:13,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.95) internal successors, (39), 21 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2022-07-23 06:03:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:03:13,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:13,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:13,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:13,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:13,639 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:13,640 INFO L85 PathProgramCache]: Analyzing trace with hash -543267076, now seen corresponding path program 1 times [2022-07-23 06:03:13,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:13,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622917015] [2022-07-23 06:03:13,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:13,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:13,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:13,649 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:13,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 06:03:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:13,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:03:13,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:13,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:14,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:03:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:14,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:14,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:14,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622917015] [2022-07-23 06:03:14,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622917015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:14,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:14,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:03:14,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229964203] [2022-07-23 06:03:14,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:14,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:03:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:14,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:03:14,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:03:14,132 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:14,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:14,739 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2022-07-23 06:03:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:03:14,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2022-07-23 06:03:14,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:14,740 INFO L225 Difference]: With dead ends: 177 [2022-07-23 06:03:14,740 INFO L226 Difference]: Without dead ends: 177 [2022-07-23 06:03:14,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:03:14,741 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 155 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:14,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 169 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:03:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-23 06:03:14,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 155. [2022-07-23 06:03:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.421875) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 182 transitions. [2022-07-23 06:03:14,744 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 182 transitions. Word has length 25 [2022-07-23 06:03:14,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:14,745 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 182 transitions. [2022-07-23 06:03:14,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 182 transitions. [2022-07-23 06:03:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 06:03:14,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:14,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:14,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:14,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:14,953 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 338589996, now seen corresponding path program 1 times [2022-07-23 06:03:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:14,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94061696] [2022-07-23 06:03:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:14,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:14,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:14,954 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:14,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-23 06:03:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:15,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 06:03:15,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:15,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:15,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-23 06:03:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:15,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:15,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:15,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94061696] [2022-07-23 06:03:15,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94061696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:15,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:15,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:03:15,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549398324] [2022-07-23 06:03:15,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:15,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:03:15,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:15,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:03:15,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:03:15,790 INFO L87 Difference]: Start difference. First operand 155 states and 182 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:16,610 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2022-07-23 06:03:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:03:16,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2022-07-23 06:03:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:16,611 INFO L225 Difference]: With dead ends: 178 [2022-07-23 06:03:16,612 INFO L226 Difference]: Without dead ends: 178 [2022-07-23 06:03:16,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:03:16,612 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 154 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:16,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 144 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 06:03:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-23 06:03:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 156. [2022-07-23 06:03:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 129 states have (on average 1.4186046511627908) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2022-07-23 06:03:16,615 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 26 [2022-07-23 06:03:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:16,615 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2022-07-23 06:03:16,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2022-07-23 06:03:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:03:16,616 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:16,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:16,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:16,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:16,823 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:16,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1906355454, now seen corresponding path program 1 times [2022-07-23 06:03:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:16,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049953193] [2022-07-23 06:03:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:16,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:16,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:16,825 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:16,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 06:03:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:16,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:03:16,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:16,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:03:17,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:17,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-23 06:03:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:17,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:17,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:17,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049953193] [2022-07-23 06:03:17,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049953193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:17,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:17,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:03:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273619371] [2022-07-23 06:03:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:17,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:03:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:03:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:03:17,311 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:18,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:18,212 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2022-07-23 06:03:18,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:03:18,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:03:18,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:18,214 INFO L225 Difference]: With dead ends: 177 [2022-07-23 06:03:18,214 INFO L226 Difference]: Without dead ends: 177 [2022-07-23 06:03:18,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:03:18,214 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 78 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:18,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 164 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 06:03:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-23 06:03:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2022-07-23 06:03:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.4090909090909092) internal successors, (186), 158 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 186 transitions. [2022-07-23 06:03:18,217 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 186 transitions. Word has length 27 [2022-07-23 06:03:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:18,217 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 186 transitions. [2022-07-23 06:03:18,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 186 transitions. [2022-07-23 06:03:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:03:18,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:18,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:18,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:18,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:18,422 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823547, now seen corresponding path program 1 times [2022-07-23 06:03:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:18,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183635415] [2022-07-23 06:03:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:18,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:18,424 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:18,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-23 06:03:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:18,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 06:03:18,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:18,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:03:19,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:19,467 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 06:03:19,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2022-07-23 06:03:19,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:19,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:03:20,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:03:20,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 31 [2022-07-23 06:03:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:20,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:20,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:20,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183635415] [2022-07-23 06:03:20,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183635415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:20,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:20,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:03:20,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134536134] [2022-07-23 06:03:20,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:20,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:03:20,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:20,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:03:20,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:03:20,185 INFO L87 Difference]: Start difference. First operand 159 states and 186 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:23,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:23,613 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2022-07-23 06:03:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:03:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:03:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:23,614 INFO L225 Difference]: With dead ends: 190 [2022-07-23 06:03:23,614 INFO L226 Difference]: Without dead ends: 190 [2022-07-23 06:03:23,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:03:23,615 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 202 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:23,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 386 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 475 Invalid, 0 Unknown, 72 Unchecked, 2.1s Time] [2022-07-23 06:03:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-23 06:03:23,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 164. [2022-07-23 06:03:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3985507246376812) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:23,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2022-07-23 06:03:23,618 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 27 [2022-07-23 06:03:23,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:23,618 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2022-07-23 06:03:23,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2022-07-23 06:03:23,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 06:03:23,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:23,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:23,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:23,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:23,830 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:23,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:23,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2126823546, now seen corresponding path program 1 times [2022-07-23 06:03:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:23,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625689176] [2022-07-23 06:03:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:23,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:23,832 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:23,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-23 06:03:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:23,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-23 06:03:23,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:23,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:03:24,047 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:03:24,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:03:24,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:03:24,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:24,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:24,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:03:24,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-23 06:03:25,286 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 06:03:25,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 38 [2022-07-23 06:03:25,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-23 06:03:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:25,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:25,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625689176] [2022-07-23 06:03:25,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625689176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:25,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:25,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:03:25,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354128331] [2022-07-23 06:03:25,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:25,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:03:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:25,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:03:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:03:25,501 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:30,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:30,206 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2022-07-23 06:03:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:03:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-23 06:03:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:30,208 INFO L225 Difference]: With dead ends: 282 [2022-07-23 06:03:30,209 INFO L226 Difference]: Without dead ends: 282 [2022-07-23 06:03:30,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2022-07-23 06:03:30,209 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 628 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:30,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 435 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 110 Unchecked, 2.6s Time] [2022-07-23 06:03:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-23 06:03:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 174. [2022-07-23 06:03:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 148 states have (on average 1.4054054054054055) internal successors, (208), 173 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2022-07-23 06:03:30,212 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 27 [2022-07-23 06:03:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:30,212 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2022-07-23 06:03:30,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:30,213 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2022-07-23 06:03:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:03:30,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:30,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:30,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:30,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:30,423 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:30,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522897, now seen corresponding path program 1 times [2022-07-23 06:03:30,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:30,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190169515] [2022-07-23 06:03:30,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:30,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:30,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:30,425 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:30,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-23 06:03:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:30,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 06:03:30,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:30,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:31,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:31,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:03:31,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:03:31,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2022-07-23 06:03:31,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 06:03:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:31,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:31,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:31,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190169515] [2022-07-23 06:03:31,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190169515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:31,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:31,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:03:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307202751] [2022-07-23 06:03:31,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:31,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:03:31,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:31,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:03:31,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:03:31,875 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:35,077 INFO L93 Difference]: Finished difference Result 198 states and 222 transitions. [2022-07-23 06:03:35,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:03:35,078 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 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 28 [2022-07-23 06:03:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:35,079 INFO L225 Difference]: With dead ends: 198 [2022-07-23 06:03:35,079 INFO L226 Difference]: Without dead ends: 198 [2022-07-23 06:03:35,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:03:35,080 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 358 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:35,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 295 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-23 06:03:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-23 06:03:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2022-07-23 06:03:35,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 174 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 210 transitions. [2022-07-23 06:03:35,083 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 210 transitions. Word has length 28 [2022-07-23 06:03:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:35,083 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 210 transitions. [2022-07-23 06:03:35,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 210 transitions. [2022-07-23 06:03:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 06:03:35,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:35,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:35,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-23 06:03:35,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:35,291 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:35,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1032522896, now seen corresponding path program 1 times [2022-07-23 06:03:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:35,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348725631] [2022-07-23 06:03:35,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:35,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:35,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:35,293 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:35,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-23 06:03:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:35,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:03:35,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:35,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:35,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:35,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348725631] [2022-07-23 06:03:35,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348725631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:35,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:35,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:03:35,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702245160] [2022-07-23 06:03:35,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:35,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:03:35,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:35,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:03:35,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:03:35,739 INFO L87 Difference]: Start difference. First operand 175 states and 210 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:35,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:35,958 INFO L93 Difference]: Finished difference Result 170 states and 202 transitions. [2022-07-23 06:03:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:03:35,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2022-07-23 06:03:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:35,961 INFO L225 Difference]: With dead ends: 170 [2022-07-23 06:03:35,961 INFO L226 Difference]: Without dead ends: 170 [2022-07-23 06:03:35,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:03:35,962 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:35,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 49 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:03:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-23 06:03:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-07-23 06:03:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3557046979865772) internal successors, (202), 169 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 202 transitions. [2022-07-23 06:03:35,966 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 202 transitions. Word has length 28 [2022-07-23 06:03:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:35,966 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 202 transitions. [2022-07-23 06:03:35,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 202 transitions. [2022-07-23 06:03:35,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:03:35,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:35,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:35,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:36,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:36,174 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:36,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:36,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1614814932, now seen corresponding path program 1 times [2022-07-23 06:03:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:36,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588982084] [2022-07-23 06:03:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:36,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:36,176 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:36,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-23 06:03:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:36,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:03:36,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:36,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:36,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:03:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:36,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:36,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588982084] [2022-07-23 06:03:36,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588982084] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:03:36,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:03:36,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-23 06:03:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350649809] [2022-07-23 06:03:36,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:03:36,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:03:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:36,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:03:36,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:03:36,712 INFO L87 Difference]: Start difference. First operand 170 states and 202 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:37,265 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2022-07-23 06:03:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:03:37,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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 30 [2022-07-23 06:03:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:37,266 INFO L225 Difference]: With dead ends: 185 [2022-07-23 06:03:37,267 INFO L226 Difference]: Without dead ends: 185 [2022-07-23 06:03:37,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:03:37,267 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 42 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:37,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 381 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 06:03:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-23 06:03:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-07-23 06:03:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3271604938271604) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-07-23 06:03:37,270 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 30 [2022-07-23 06:03:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:37,270 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-07-23 06:03:37,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:37,270 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-07-23 06:03:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:03:37,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:37,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:37,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:37,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:37,478 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash -842646633, now seen corresponding path program 1 times [2022-07-23 06:03:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935683561] [2022-07-23 06:03:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:37,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:37,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:37,480 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:37,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-23 06:03:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:37,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:03:37,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:37,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:03:37,690 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:03:37,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:03:38,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:38,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:03:38,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:38,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-23 06:03:38,637 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:03:38,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-07-23 06:03:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:38,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:38,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:38,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935683561] [2022-07-23 06:03:38,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935683561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:38,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:38,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 06:03:38,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627017982] [2022-07-23 06:03:38,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:38,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:03:38,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:38,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:03:38,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:03:38,815 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:43,875 INFO L93 Difference]: Finished difference Result 284 states and 304 transitions. [2022-07-23 06:03:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:03:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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 30 [2022-07-23 06:03:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:43,878 INFO L225 Difference]: With dead ends: 284 [2022-07-23 06:03:43,878 INFO L226 Difference]: Without dead ends: 284 [2022-07-23 06:03:43,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:03:43,879 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 548 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:43,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 451 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 555 Invalid, 0 Unknown, 76 Unchecked, 2.7s Time] [2022-07-23 06:03:43,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-07-23 06:03:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 183. [2022-07-23 06:03:43,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 182 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 213 transitions. [2022-07-23 06:03:43,882 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 213 transitions. Word has length 30 [2022-07-23 06:03:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:43,882 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 213 transitions. [2022-07-23 06:03:43,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 213 transitions. [2022-07-23 06:03:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:03:43,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:43,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:43,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-23 06:03:44,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:44,088 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:44,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -842657618, now seen corresponding path program 1 times [2022-07-23 06:03:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:44,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457949276] [2022-07-23 06:03:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:44,090 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:44,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-23 06:03:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:44,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-23 06:03:44,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:44,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:03:44,395 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:03:44,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:03:44,667 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:03:44,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 06:03:44,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:03:45,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:45,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-23 06:03:45,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:45,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-23 06:03:45,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-07-23 06:03:45,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-07-23 06:03:46,388 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 06:03:46,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 48 [2022-07-23 06:03:46,950 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 06:03:46,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2022-07-23 06:03:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:47,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:47,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:47,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457949276] [2022-07-23 06:03:47,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457949276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:47,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:47,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 06:03:47,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134862912] [2022-07-23 06:03:47,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:47,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:03:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:03:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-23 06:03:47,057 INFO L87 Difference]: Start difference. First operand 183 states and 213 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:03:51,064 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2022-07-23 06:03:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:03:51,066 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 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 30 [2022-07-23 06:03:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:03:51,066 INFO L225 Difference]: With dead ends: 195 [2022-07-23 06:03:51,066 INFO L226 Difference]: Without dead ends: 195 [2022-07-23 06:03:51,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2022-07-23 06:03:51,067 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 169 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:03:51,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 581 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 285 Invalid, 0 Unknown, 168 Unchecked, 1.5s Time] [2022-07-23 06:03:51,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-23 06:03:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2022-07-23 06:03:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 162 states have (on average 1.308641975308642) internal successors, (212), 182 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:51,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 212 transitions. [2022-07-23 06:03:51,070 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 212 transitions. Word has length 30 [2022-07-23 06:03:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:03:51,070 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 212 transitions. [2022-07-23 06:03:51,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:03:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 212 transitions. [2022-07-23 06:03:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-23 06:03:51,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:03:51,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:03:51,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-23 06:03:51,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:03:51,280 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:03:51,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:03:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash -352582234, now seen corresponding path program 1 times [2022-07-23 06:03:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:03:51,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496086981] [2022-07-23 06:03:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:03:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:03:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:03:51,281 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:03:51,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-23 06:03:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:03:51,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:03:51,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:03:51,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:03:51,597 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:03:51,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 06:03:51,927 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:03:51,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 06:03:52,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:03:52,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:03:52,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-23 06:03:52,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:03:52,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:03:53,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-23 06:03:53,074 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-23 06:03:53,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2022-07-23 06:03:54,161 INFO L356 Elim1Store]: treesize reduction 76, result has 3.8 percent of original size [2022-07-23 06:03:54,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 118 treesize of output 53 [2022-07-23 06:03:54,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 19 [2022-07-23 06:03:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:03:54,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:03:54,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:03:54,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496086981] [2022-07-23 06:03:54,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496086981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:03:54,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:03:54,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-23 06:03:54,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219011757] [2022-07-23 06:03:54,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:03:54,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 06:03:54,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:03:54,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 06:03:54,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-07-23 06:03:54,812 INFO L87 Difference]: Start difference. First operand 183 states and 212 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:04:00,653 INFO L93 Difference]: Finished difference Result 247 states and 275 transitions. [2022-07-23 06:04:00,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 06:04:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 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 31 [2022-07-23 06:04:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:04:00,654 INFO L225 Difference]: With dead ends: 247 [2022-07-23 06:04:00,654 INFO L226 Difference]: Without dead ends: 245 [2022-07-23 06:04:00,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2022-07-23 06:04:00,655 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 275 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:04:00,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 841 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 413 Invalid, 0 Unknown, 420 Unchecked, 2.0s Time] [2022-07-23 06:04:00,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-23 06:04:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 178. [2022-07-23 06:04:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 177 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2022-07-23 06:04:00,658 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 31 [2022-07-23 06:04:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:04:00,658 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2022-07-23 06:04:00,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2022-07-23 06:04:00,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:04:00,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:04:00,659 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:04:00,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-23 06:04:00,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:04:00,867 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:04:00,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:04:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash -822688907, now seen corresponding path program 1 times [2022-07-23 06:04:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:04:00,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970626547] [2022-07-23 06:04:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:04:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:04:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:04:00,869 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:04:00,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-23 06:04:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:04:00,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-23 06:04:00,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:04:01,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:04:01,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-07-23 06:04:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:07,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:04:10,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-07-23 06:04:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:15,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:04:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970626547] [2022-07-23 06:04:15,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970626547] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:04:15,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:04:15,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-23 06:04:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706498566] [2022-07-23 06:04:15,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:04:15,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 06:04:15,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:04:15,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 06:04:15,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=139, Unknown=5, NotChecked=0, Total=182 [2022-07-23 06:04:15,264 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:04:15,994 INFO L93 Difference]: Finished difference Result 210 states and 238 transitions. [2022-07-23 06:04:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:04:15,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 06:04:15,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:04:15,995 INFO L225 Difference]: With dead ends: 210 [2022-07-23 06:04:15,995 INFO L226 Difference]: Without dead ends: 208 [2022-07-23 06:04:15,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=44, Invalid=161, Unknown=5, NotChecked=0, Total=210 [2022-07-23 06:04:15,996 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 7 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:04:15,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 386 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 164 Unchecked, 0.5s Time] [2022-07-23 06:04:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-07-23 06:04:15,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2022-07-23 06:04:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2022-07-23 06:04:15,998 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 32 [2022-07-23 06:04:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:04:15,998 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2022-07-23 06:04:15,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2022-07-23 06:04:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:04:15,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:04:15,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:04:16,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-23 06:04:16,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:04:16,206 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:04:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:04:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -822688903, now seen corresponding path program 1 times [2022-07-23 06:04:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:04:16,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466977016] [2022-07-23 06:04:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:04:16,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:04:16,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:04:16,208 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:04:16,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-23 06:04:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:04:16,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 06:04:16,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:04:16,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:04:16,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 06:04:16,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:04:16,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-07-23 06:04:17,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:04:17,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:04:17,247 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 06:04:17,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-07-23 06:04:17,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:04:17,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:04:17,378 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 06:04:17,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-07-23 06:04:17,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:17,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-07-23 06:04:17,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:17,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2022-07-23 06:04:19,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:04:19,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:04:19,724 INFO L356 Elim1Store]: treesize reduction 27, result has 37.2 percent of original size [2022-07-23 06:04:19,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 96 treesize of output 84 [2022-07-23 06:04:19,737 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:04:19,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 53 [2022-07-23 06:04:19,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-07-23 06:04:19,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-07-23 06:04:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:20,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:04:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:43,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:04:43,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466977016] [2022-07-23 06:04:43,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466977016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:04:43,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:04:43,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-07-23 06:04:43,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511715603] [2022-07-23 06:04:43,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:04:43,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 06:04:43,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:04:43,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 06:04:43,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=786, Unknown=8, NotChecked=0, Total=930 [2022-07-23 06:04:43,173 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:04:49,252 INFO L93 Difference]: Finished difference Result 213 states and 241 transitions. [2022-07-23 06:04:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:04:49,254 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-23 06:04:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:04:49,255 INFO L225 Difference]: With dead ends: 213 [2022-07-23 06:04:49,255 INFO L226 Difference]: Without dead ends: 196 [2022-07-23 06:04:49,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=280, Invalid=1434, Unknown=8, NotChecked=0, Total=1722 [2022-07-23 06:04:49,255 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 73 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:04:49,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 906 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 383 Invalid, 0 Unknown, 96 Unchecked, 2.2s Time] [2022-07-23 06:04:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-07-23 06:04:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 189. [2022-07-23 06:04:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.2857142857142858) internal successors, (216), 188 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 216 transitions. [2022-07-23 06:04:49,261 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 216 transitions. Word has length 32 [2022-07-23 06:04:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:04:49,262 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 216 transitions. [2022-07-23 06:04:49,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 216 transitions. [2022-07-23 06:04:49,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:04:49,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:04:49,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:04:49,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-23 06:04:49,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:04:49,470 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:04:49,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:04:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash 798159371, now seen corresponding path program 1 times [2022-07-23 06:04:49,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:04:49,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461522737] [2022-07-23 06:04:49,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:04:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:04:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:04:49,472 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:04:49,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-23 06:04:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:04:49,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:04:49,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:04:49,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:04:49,708 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:04:49,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:04:49,979 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:04:49,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-23 06:04:50,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:04:50,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-23 06:04:50,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:04:50,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-07-23 06:04:51,023 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-23 06:04:51,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-07-23 06:04:51,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-23 06:04:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:51,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:04:51,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:04:51,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461522737] [2022-07-23 06:04:51,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461522737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:04:51,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:04:51,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:04:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763670168] [2022-07-23 06:04:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:04:51,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:04:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:04:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:04:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:04:51,322 INFO L87 Difference]: Start difference. First operand 189 states and 216 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:04:53,769 INFO L93 Difference]: Finished difference Result 212 states and 231 transitions. [2022-07-23 06:04:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:04:53,769 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 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 33 [2022-07-23 06:04:53,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:04:53,770 INFO L225 Difference]: With dead ends: 212 [2022-07-23 06:04:53,770 INFO L226 Difference]: Without dead ends: 212 [2022-07-23 06:04:53,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-07-23 06:04:53,770 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 214 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:04:53,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 310 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 284 Invalid, 0 Unknown, 70 Unchecked, 1.3s Time] [2022-07-23 06:04:53,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-23 06:04:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 191. [2022-07-23 06:04:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 190 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:53,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 218 transitions. [2022-07-23 06:04:53,773 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 218 transitions. Word has length 33 [2022-07-23 06:04:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:04:53,773 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 218 transitions. [2022-07-23 06:04:53,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 218 transitions. [2022-07-23 06:04:53,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:04:53,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:04:53,774 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:04:53,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-23 06:04:53,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:04:53,988 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:04:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:04:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1995423857, now seen corresponding path program 1 times [2022-07-23 06:04:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:04:53,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23449681] [2022-07-23 06:04:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:04:53,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:04:53,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:04:53,990 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:04:53,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-23 06:04:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:04:54,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:04:54,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:04:54,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:04:55,107 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-23 06:04:55,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-07-23 06:04:55,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:04:55,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:04:55,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:04:55,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2022-07-23 06:04:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:04:55,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:04:55,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:04:55,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23449681] [2022-07-23 06:04:55,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23449681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:04:55,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:04:55,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:04:55,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904562358] [2022-07-23 06:04:55,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:04:55,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 06:04:55,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:04:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 06:04:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:04:55,717 INFO L87 Difference]: Start difference. First operand 191 states and 218 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:04:57,769 INFO L93 Difference]: Finished difference Result 229 states and 247 transitions. [2022-07-23 06:04:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 06:04:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 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 36 [2022-07-23 06:04:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:04:57,770 INFO L225 Difference]: With dead ends: 229 [2022-07-23 06:04:57,770 INFO L226 Difference]: Without dead ends: 229 [2022-07-23 06:04:57,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:04:57,770 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 182 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:04:57,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 433 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 226 Invalid, 0 Unknown, 52 Unchecked, 1.0s Time] [2022-07-23 06:04:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-23 06:04:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 191. [2022-07-23 06:04:57,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.2705882352941176) internal successors, (216), 190 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 216 transitions. [2022-07-23 06:04:57,774 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 216 transitions. Word has length 36 [2022-07-23 06:04:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:04:57,774 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 216 transitions. [2022-07-23 06:04:57,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:04:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 216 transitions. [2022-07-23 06:04:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 06:04:57,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:04:57,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:04:57,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-23 06:04:57,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:04:57,983 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:04:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:04:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1026976127, now seen corresponding path program 1 times [2022-07-23 06:04:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:04:57,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748842119] [2022-07-23 06:04:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:04:57,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:04:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:04:57,984 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:04:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-23 06:04:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:04:58,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 06:04:58,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:04:58,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:04:58,388 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:04:58,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-23 06:04:58,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:04:58,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:04:58,982 INFO L356 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2022-07-23 06:04:58,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2022-07-23 06:04:59,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-23 06:05:00,008 INFO L356 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2022-07-23 06:05:00,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 31 [2022-07-23 06:05:00,260 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-23 06:05:00,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 39 [2022-07-23 06:05:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:00,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:05:00,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:05:00,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748842119] [2022-07-23 06:05:00,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748842119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:00,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:00,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 06:05:00,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247040772] [2022-07-23 06:05:00,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:00,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 06:05:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:05:00,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 06:05:00,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:05:00,446 INFO L87 Difference]: Start difference. First operand 191 states and 216 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:02,628 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2022-07-23 06:05:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 06:05:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 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 36 [2022-07-23 06:05:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:02,630 INFO L225 Difference]: With dead ends: 200 [2022-07-23 06:05:02,630 INFO L226 Difference]: Without dead ends: 200 [2022-07-23 06:05:02,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=90, Invalid=329, Unknown=1, NotChecked=0, Total=420 [2022-07-23 06:05:02,630 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 93 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:02,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 370 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 219 Invalid, 0 Unknown, 201 Unchecked, 1.1s Time] [2022-07-23 06:05:02,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-23 06:05:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2022-07-23 06:05:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.2658959537572254) internal successors, (219), 193 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:02,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 219 transitions. [2022-07-23 06:05:02,633 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 219 transitions. Word has length 36 [2022-07-23 06:05:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:02,633 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 219 transitions. [2022-07-23 06:05:02,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 219 transitions. [2022-07-23 06:05:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:05:02,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:02,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:02,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:02,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:05:02,844 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:05:02,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1771489038, now seen corresponding path program 1 times [2022-07-23 06:05:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:05:02,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832348700] [2022-07-23 06:05:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:05:02,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:05:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:05:02,846 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:05:02,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-23 06:05:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:05:03,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-23 06:05:03,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:03,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:05:03,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 06:05:03,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 06:05:04,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-23 06:05:04,233 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:05:04,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2022-07-23 06:05:04,496 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-23 06:05:04,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2022-07-23 06:05:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:04,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:05:04,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:05:04,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832348700] [2022-07-23 06:05:04,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832348700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:05:04,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:05:04,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:05:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650956763] [2022-07-23 06:05:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:05:04,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:05:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:05:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:05:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:05:04,575 INFO L87 Difference]: Start difference. First operand 194 states and 219 transitions. Second operand has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:05:06,840 INFO L93 Difference]: Finished difference Result 210 states and 226 transitions. [2022-07-23 06:05:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:05:06,841 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2022-07-23 06:05:06,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:05:06,842 INFO L225 Difference]: With dead ends: 210 [2022-07-23 06:05:06,842 INFO L226 Difference]: Without dead ends: 210 [2022-07-23 06:05:06,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-07-23 06:05:06,842 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 279 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:05:06,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 414 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 233 Invalid, 0 Unknown, 63 Unchecked, 1.1s Time] [2022-07-23 06:05:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-23 06:05:06,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 190. [2022-07-23 06:05:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2781065088757397) internal successors, (216), 189 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2022-07-23 06:05:06,845 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 37 [2022-07-23 06:05:06,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:05:06,845 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2022-07-23 06:05:06,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.7) internal successors, (37), 11 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 06:05:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2022-07-23 06:05:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:05:06,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:05:06,846 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:05:06,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-23 06:05:07,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:05:07,047 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-07-23 06:05:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:05:07,047 INFO L85 PathProgramCache]: Analyzing trace with hash -220546803, now seen corresponding path program 3 times [2022-07-23 06:05:07,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:05:07,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120572455] [2022-07-23 06:05:07,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:05:07,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:05:07,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:05:07,048 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:05:07,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-23 06:05:07,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 06:05:07,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:05:07,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-23 06:05:07,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:05:07,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:05:07,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 06:05:07,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:05:07,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 06:05:07,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:05:08,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:05:08,415 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:05:08,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 06:05:08,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:05:08,846 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:05:08,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2022-07-23 06:05:08,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-07-23 06:05:09,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-07-23 06:05:09,354 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:05:09,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-07-23 06:05:09,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2022-07-23 06:05:09,859 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:05:09,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2022-07-23 06:05:10,390 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:05:10,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-23 06:05:10,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-23 06:05:10,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-23 06:05:10,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-23 06:05:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 06:05:10,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:05:11,553 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2022-07-23 06:05:11,629 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3))))) is different from false [2022-07-23 06:05:12,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse1 (bvadd (_ bv4 32) .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (not (bvule (bvadd .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse1)) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (not (bvslt (bvadd |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (_ bv20 32))) (and (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1346) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32))))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1345)) (.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1346) .cse5 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))))) is different from false [2022-07-23 06:05:12,739 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse10 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse11 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (bvadd (_ bv4 32) .cse10 .cse11))) (or (not (bvule .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (not (bvslt (bvadd |c_ULTIMATE.start_create_data_~counter~0#1| (_ bv1 32)) (_ bv20 32))) (and (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1345))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1346) .cse3 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1346) (select (select (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) v_ArrVal_1347)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (.cse7 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse6 (_ bv8 32) .cse7) (bvadd .cse6 .cse7 (_ bv12 32)))))) (not (bvule (bvadd .cse10 .cse11) .cse0)))))) is different from false [2022-07-23 06:05:13,077 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (bvadd (_ bv8 32) .cse2 .cse3))) (or (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (not (bvule (bvadd (_ bv4 32) .cse2 .cse3) .cse0)) (and (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1345))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1346) .cse5 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) (_ bv16 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))))))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse11))) (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1346) (select (select (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse11) v_ArrVal_1347)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse11))) (.cse9 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse8 .cse9 (_ bv12 32)) (bvadd .cse8 (_ bv16 32) .cse9))))))))) is different from false [2022-07-23 06:05:13,610 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse1 (bvadd (_ bv4 32) .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (not (bvule (bvadd .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse1)) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (and (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1343))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344) .cse4 v_ArrVal_1346) (select (select (store .cse5 .cse4 v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1347))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse2 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse2 .cse3)))) (not (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))))))) (not (let ((.cse8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse9 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse8 (_ bv4 32) .cse9) (bvadd .cse8 (_ bv8 32) .cse9)))))) (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1343)) (.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse10 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse12))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_1345))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse12))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344) .cse10 v_ArrVal_1346) .cse11 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse12) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse12)))))))) (not (let ((.cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse15) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse15))))))) (not (let ((.cse16 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse17 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse16 (_ bv4 32) .cse17) (bvadd .cse16 (_ bv8 32) .cse17)))))))))) is different from false [2022-07-23 06:05:13,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse24 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse25 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (let ((.cse0 (bvadd (_ bv4 32) .cse24 .cse25))) (or (not (bvule .cse0 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (and (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1343))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (store (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1344) .cse5 v_ArrVal_1346) (select (select (store .cse6 .cse5 v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) v_ArrVal_1347)))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse2 .cse3 (_ bv12 32)) (bvadd (_ bv16 32) .cse2 .cse3)))) (not (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9)))))))) (not (let ((.cse10 (let ((.cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse12) v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse12))) (.cse11 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv4 32) .cse10 .cse11) (bvadd (_ bv8 32) .cse10 .cse11)))))) (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse14 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14)))))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18))) (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse15 v_ArrVal_1343))) (let ((.cse16 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18))) (let ((.cse19 (store .cse20 .cse16 v_ArrVal_1345))) (let ((.cse17 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_1344) .cse16 v_ArrVal_1346) .cse17 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store .cse19 .cse17 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18)))))))))))) (not (let ((.cse21 (let ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse23) v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse23))) (.cse22 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv4 32) .cse21 .cse22) (bvadd (_ bv8 32) .cse21 .cse22))))))) (not (bvslt (bvadd (_ bv2 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule (bvadd .cse24 .cse25) .cse0)))))) is different from false [2022-07-23 06:05:14,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse24 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse25 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse23))) (let ((.cse22 (bvadd (_ bv8 32) .cse24 .cse25))) (or (and (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1343))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1344) .cse3 v_ArrVal_1346) (select (select (store .cse4 .cse3 v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5) v_ArrVal_1347)))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse5))) (.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv20 32))))) (not (let ((.cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse7)))))))) (not (let ((.cse8 (let ((.cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10) v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse10))) (.cse9 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv8 32) .cse8 .cse9) (bvadd .cse8 .cse9 (_ bv12 32))))))) (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14))) (let ((.cse16 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1343))) (let ((.cse12 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14))) (let ((.cse15 (store .cse16 .cse12 v_ArrVal_1345))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse11 v_ArrVal_1344) .cse12 v_ArrVal_1346) .cse13 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32)) (select |c_#length| (select (select (store .cse15 .cse13 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse14)))))))))) (not (let ((.cse18 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse17 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse18)))))))) (not (let ((.cse19 (let ((.cse21 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse21) v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse21))) (.cse20 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv8 32) .cse19 .cse20) (bvadd .cse19 .cse20 (_ bv12 32)))))))) (not (bvule .cse22 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse23)))) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (not (bvule (bvadd (_ bv4 32) .cse24 .cse25) .cse22)))))) is different from false [2022-07-23 06:05:15,419 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (let ((.cse1 (bvadd (_ bv4 32) .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|))) (or (not (bvule (bvadd .cse0 |c_ULTIMATE.start_create_data_#t~mem8#1.offset|) .cse1)) (not (bvule .cse1 (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem8#1.base|))) (not (bvslt (bvadd (_ bv3 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse2 (_ bv4 32) .cse3) (bvadd .cse2 (_ bv8 32) .cse3)))) (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))))) (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341)) (.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_1343))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_1345))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) .cse5 v_ArrVal_1344) .cse6 v_ArrVal_1346) .cse7 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse8)))))))))) (not (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341)) (.cse13 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse13))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) .cse12 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse13) (_ bv12 32)) (select |c_#length| (select (select (store .cse14 .cse12 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse13)))))))) (not (let ((.cse15 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse16 (let ((.cse17 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse17) v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse17)))) (bvule (bvadd (_ bv8 32) .cse15 .cse16) (bvadd .cse15 .cse16 (_ bv12 32))))))))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse18 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (.cse19 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd .cse18 (_ bv4 32) .cse19) (bvadd .cse18 (_ bv8 32) .cse19)))) (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse20 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse20) (_ bv8 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse20))))) (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse23 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341)) (.cse22 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse22))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) .cse21 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse22) (_ bv12 32)) (select |c_#length| (select (select (store .cse23 .cse21 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse22)))))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (let ((.cse29 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse30 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341))) (let ((.cse26 (select (select .cse30 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse29))) (let ((.cse28 (store .cse30 .cse26 v_ArrVal_1343))) (let ((.cse27 (select (select .cse28 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse29))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) .cse26 v_ArrVal_1344) .cse27 v_ArrVal_1346) (select (select (store .cse28 .cse27 v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse29) v_ArrVal_1347))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse29))) (.cse25 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|))) (bvule (bvadd (_ bv16 32) .cse24 .cse25) (bvadd .cse24 .cse25 (_ bv20 32))))))) (not (let ((.cse31 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse32 (let ((.cse33 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1342) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem8#1.base| v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse33) v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse33)))) (bvule (bvadd (_ bv8 32) .cse31 .cse32) (bvadd .cse31 .cse32 (_ bv12 32))))))))))))))) is different from false [2022-07-23 06:05:20,453 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse43 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse44 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse45 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse43))) (let ((.cse42 (bvadd (_ bv8 32) .cse44 .cse45))) (or (not (bvslt (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (_ bv20 32))) (and (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse0 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse1 (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse4 (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1342) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6) v_ArrVal_1344)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse6)))) (bvule (bvadd .cse3 .cse4 (_ bv12 32)) (bvadd (_ bv16 32) .cse3 .cse4)))) (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_1341))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9))) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_1342) .cse8 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse9)))))))) (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse12 (let ((.cse17 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse17))) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse13 v_ArrVal_1341))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse17))) (let ((.cse16 (store .cse18 .cse14 v_ArrVal_1343))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse17))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse13 v_ArrVal_1342) .cse14 v_ArrVal_1344) .cse15 v_ArrVal_1346) (select (select (store .cse16 .cse15 v_ArrVal_1345) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse17) v_ArrVal_1347)))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse17)))) (bvule (bvadd .cse11 .cse12 (_ bv20 32)) (bvadd .cse11 .cse12 (_ bv24 32))))))))) (not (let ((.cse20 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse19 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse20))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse19 v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse20) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse19 v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse20)))))))))) (forall ((v_ArrVal_1342 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse21 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse22 (let ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse23) v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse23)))) (bvule (bvadd (_ bv8 32) .cse21 .cse22) (bvadd .cse21 .cse22 (_ bv12 32))))) (forall ((v_ArrVal_1341 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1344 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse24 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|)) (.cse25 (let ((.cse27 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (select (select (let ((.cse26 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse27))) (store (store |c_#memory_$Pointer$.offset| .cse26 v_ArrVal_1342) (select (select (store |c_#memory_$Pointer$.base| .cse26 v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse27) v_ArrVal_1344)) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse27)))) (bvule (bvadd .cse24 .cse25 (_ bv12 32)) (bvadd (_ bv16 32) .cse24 .cse25)))) (forall ((v_ArrVal_1343 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1347 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1345 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse32))) (let ((.cse35 (store |c_#memory_$Pointer$.base| .cse28 v_ArrVal_1341))) (let ((.cse29 (select (select .cse35 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse32))) (let ((.cse34 (store .cse35 .cse29 v_ArrVal_1343))) (let ((.cse30 (select (select .cse34 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse32))) (let ((.cse33 (store .cse34 .cse30 v_ArrVal_1345))) (let ((.cse31 (select (select .cse33 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse32))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse28 v_ArrVal_1342) .cse29 v_ArrVal_1344) .cse30 v_ArrVal_1346) .cse31 v_ArrVal_1347) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse32) (_ bv24 32)) (select |c_#length| (select (select (store .cse33 .cse31 v_ArrVal_1348) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse32)))))))))))) (not (let ((.cse38 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse36 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse38))) (let ((.cse39 (store |c_#memory_$Pointer$.base| .cse36 v_ArrVal_1341))) (let ((.cse37 (select (select .cse39 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse38))) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store (store |c_#memory_$Pointer$.offset| .cse36 v_ArrVal_1342) .cse37 v_ArrVal_1344) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse38)) (select |c_#length| (select (select (store .cse39 .cse37 v_ArrVal_1343) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse38)))))))))))) (not (let ((.cse41 (bvadd (_ bv4 32) |c_ULTIMATE.start_create_data_~data~0#1.offset|))) (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse41))) (bvule (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_data_~counter~0#1|) (select (select (store |c_#memory_$Pointer$.offset| .cse40 v_ArrVal_1342) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse41) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse40 v_ArrVal_1341) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse41))))))))))) (not (bvule .cse42 (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse43)))) (not (bvule (bvadd (_ bv4 32) .cse44 .cse45) .cse42)))))) is different from false