./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 05:35:33,027 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 05:35:33,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 05:35:33,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 05:35:33,057 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 05:35:33,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 05:35:33,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 05:35:33,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 05:35:33,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 05:35:33,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 05:35:33,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 05:35:33,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 05:35:33,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 05:35:33,072 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 05:35:33,073 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 05:35:33,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 05:35:33,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 05:35:33,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 05:35:33,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 05:35:33,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 05:35:33,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 05:35:33,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 05:35:33,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 05:35:33,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 05:35:33,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 05:35:33,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 05:35:33,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 05:35:33,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 05:35:33,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 05:35:33,091 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 05:35:33,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 05:35:33,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 05:35:33,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 05:35:33,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 05:35:33,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 05:35:33,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 05:35:33,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 05:35:33,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 05:35:33,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 05:35:33,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 05:35:33,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 05:35:33,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 05:35:33,126 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 05:35:33,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 05:35:33,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 05:35:33,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 05:35:33,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 05:35:33,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 05:35:33,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 05:35:33,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 05:35:33,129 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 05:35:33,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 05:35:33,129 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 05:35:33,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 05:35:33,131 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 05:35:33,131 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 05:35:33,131 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 05:35:33,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 05:35:33,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 05:35:33,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 05:35:33,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 05:35:33,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 05:35:33,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 05:35:33,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 05:35:33,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 05:35:33,132 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 05:35:33,132 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 05:35:33,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 05:35:33,133 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 05:35:33,133 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2023-02-18 05:35:33,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 05:35:33,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 05:35:33,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 05:35:33,324 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 05:35:33,324 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 05:35:33,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-18 05:35:34,288 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 05:35:34,516 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 05:35:34,517 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-18 05:35:34,524 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599d73280/7ebd955ef74f4ff0b4cf2f9e269869b6/FLAGd25963019 [2023-02-18 05:35:34,536 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599d73280/7ebd955ef74f4ff0b4cf2f9e269869b6 [2023-02-18 05:35:34,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 05:35:34,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 05:35:34,539 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 05:35:34,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 05:35:34,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 05:35:34,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:35:34" (1/1) ... [2023-02-18 05:35:34,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e19076 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:34, skipping insertion in model container [2023-02-18 05:35:34,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:35:34" (1/1) ... [2023-02-18 05:35:34,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 05:35:34,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 05:35:34,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 05:35:34,854 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) [2023-02-18 05:35:34,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@64a03053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:34, skipping insertion in model container [2023-02-18 05:35:34,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 05:35:34,857 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-18 05:35:34,858 INFO L158 Benchmark]: Toolchain (without parser) took 319.29ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 109.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-18 05:35:34,858 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 05:35:34,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.77ms. Allocated memory is still 153.1MB. Free memory was 121.3MB in the beginning and 109.5MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-18 05:35:34,860 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.77ms. Allocated memory is still 153.1MB. Free memory was 121.3MB in the beginning and 109.5MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types 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/complex_data_creation_test02-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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 05:35:36,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 05:35:36,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 05:35:36,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 05:35:36,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 05:35:36,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 05:35:36,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 05:35:36,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 05:35:36,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 05:35:36,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 05:35:36,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 05:35:36,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 05:35:36,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 05:35:36,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 05:35:36,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 05:35:36,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 05:35:36,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 05:35:36,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 05:35:36,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 05:35:36,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 05:35:36,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 05:35:36,803 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 05:35:36,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 05:35:36,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 05:35:36,811 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 05:35:36,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 05:35:36,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 05:35:36,813 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 05:35:36,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 05:35:36,814 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 05:35:36,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 05:35:36,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 05:35:36,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 05:35:36,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 05:35:36,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 05:35:36,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 05:35:36,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 05:35:36,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 05:35:36,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 05:35:36,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 05:35:36,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 05:35:36,826 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-18 05:35:36,858 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 05:35:36,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 05:35:36,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 05:35:36,859 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 05:35:36,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 05:35:36,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 05:35:36,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 05:35:36,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 05:35:36,861 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 05:35:36,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 05:35:36,862 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 05:35:36,863 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 05:35:36,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 05:35:36,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 05:35:36,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 05:35:36,863 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 05:35:36,863 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 05:35:36,864 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 05:35:36,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 05:35:36,864 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 05:35:36,864 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 05:35:36,864 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 05:35:36,864 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 05:35:36,865 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 05:35:36,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 05:35:36,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 05:35:36,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 05:35:36,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 05:35:36,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 05:35:36,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 05:35:36,866 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 05:35:36,866 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 05:35:36,866 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 05:35:36,867 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 05:35:36,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 05:35:36,867 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 05:35:36,867 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 05:35:36,867 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2023-02-18 05:35:37,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 05:35:37,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 05:35:37,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 05:35:37,181 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 05:35:37,181 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 05:35:37,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-18 05:35:38,267 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 05:35:38,491 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 05:35:38,492 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-18 05:35:38,516 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d778ffa/168a404a5b294d079c9debd100efdc2b/FLAGe9752bcfb [2023-02-18 05:35:38,532 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d778ffa/168a404a5b294d079c9debd100efdc2b [2023-02-18 05:35:38,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 05:35:38,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 05:35:38,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 05:35:38,538 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 05:35:38,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 05:35:38,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1a271f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38, skipping insertion in model container [2023-02-18 05:35:38,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,548 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 05:35:38,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 05:35:38,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 05:35:38,770 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-18 05:35:38,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 05:35:38,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 05:35:38,801 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 05:35:38,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 05:35:38,845 INFO L208 MainTranslator]: Completed translation [2023-02-18 05:35:38,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38 WrapperNode [2023-02-18 05:35:38,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 05:35:38,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 05:35:38,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 05:35:38,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 05:35:38,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,934 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-18 05:35:38,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 05:35:38,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 05:35:38,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 05:35:38,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 05:35:38,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,948 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,973 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 05:35:38,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 05:35:38,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 05:35:38,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 05:35:38,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (1/1) ... [2023-02-18 05:35:38,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 05:35:39,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 05:35:39,035 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) [2023-02-18 05:35:39,067 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 [2023-02-18 05:35:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-18 05:35:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 05:35:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-02-18 05:35:39,092 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-02-18 05:35:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 05:35:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 05:35:39,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 05:35:39,171 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 05:35:39,173 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 05:35:39,839 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 05:35:39,847 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 05:35:39,847 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-18 05:35:39,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:35:39 BoogieIcfgContainer [2023-02-18 05:35:39,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 05:35:39,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 05:35:39,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 05:35:39,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 05:35:39,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 05:35:38" (1/3) ... [2023-02-18 05:35:39,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128842f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:35:39, skipping insertion in model container [2023-02-18 05:35:39,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 05:35:38" (2/3) ... [2023-02-18 05:35:39,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128842f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 05:35:39, skipping insertion in model container [2023-02-18 05:35:39,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 05:35:39" (3/3) ... [2023-02-18 05:35:39,857 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2023-02-18 05:35:39,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 05:35:39,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-18 05:35:39,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 05:35:39,923 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6618b6e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 05:35:39,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-18 05:35:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 05:35:39,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:39,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 05:35:39,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2023-02-18 05:35:39,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:39,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727966689] [2023-02-18 05:35:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:39,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:39,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:39,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:39,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-18 05:35:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:40,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 05:35:40,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:40,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:40,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:40,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:40,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727966689] [2023-02-18 05:35:40,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727966689] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:40,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:40,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:35:40,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873535778] [2023-02-18 05:35:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:40,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 05:35:40,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 05:35:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 05:35:40,067 INFO L87 Difference]: Start difference. First operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-02-18 05:35:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:40,098 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2023-02-18 05:35:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 05:35:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-02-18 05:35:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:40,109 INFO L225 Difference]: With dead ends: 189 [2023-02-18 05:35:40,109 INFO L226 Difference]: Without dead ends: 187 [2023-02-18 05:35:40,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 05:35:40,114 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:40,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:35:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-18 05:35:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-02-18 05:35:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2023-02-18 05:35:40,162 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2023-02-18 05:35:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:40,163 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2023-02-18 05:35:40,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-02-18 05:35:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2023-02-18 05:35:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 05:35:40,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:40,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 05:35:40,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:40,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:40,374 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2023-02-18 05:35:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:40,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [999162836] [2023-02-18 05:35:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:40,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:40,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:40,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:40,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-18 05:35:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:40,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 05:35:40,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:40,461 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:40,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:40,472 INFO L350 Elim1Store]: Elim1 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 28 [2023-02-18 05:35:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:40,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:40,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:40,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [999162836] [2023-02-18 05:35:40,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [999162836] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:40,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:40,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 05:35:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75510724] [2023-02-18 05:35:40,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:40,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:35:40,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:35:40,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:35:40,487 INFO L87 Difference]: Start difference. First operand 187 states and 198 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) [2023-02-18 05:35:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:40,866 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2023-02-18 05:35:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:35:40,867 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 [2023-02-18 05:35:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:40,868 INFO L225 Difference]: With dead ends: 207 [2023-02-18 05:35:40,868 INFO L226 Difference]: Without dead ends: 207 [2023-02-18 05:35:40,868 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 [2023-02-18 05:35:40,869 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:40,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 287 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:35:40,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-18 05:35:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-02-18 05:35:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2023-02-18 05:35:40,876 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2023-02-18 05:35:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:40,876 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2023-02-18 05:35:40,876 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) [2023-02-18 05:35:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2023-02-18 05:35:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-18 05:35:40,877 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:40,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-18 05:35:40,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:41,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:41,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:41,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:41,084 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2023-02-18 05:35:41,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:41,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988775938] [2023-02-18 05:35:41,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:41,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:41,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:41,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:41,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-18 05:35:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:41,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 05:35:41,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:41,170 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:41,173 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:41,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:35:41,184 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:41,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:41,187 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:35:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:41,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:41,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:41,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988775938] [2023-02-18 05:35:41,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988775938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:41,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:41,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 05:35:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782091492] [2023-02-18 05:35:41,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:41,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:35:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:41,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:35:41,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:35:41,194 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:41,613 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2023-02-18 05:35:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 05:35:41,617 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 [2023-02-18 05:35:41,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:41,618 INFO L225 Difference]: With dead ends: 197 [2023-02-18 05:35:41,619 INFO L226 Difference]: Without dead ends: 197 [2023-02-18 05:35:41,619 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 [2023-02-18 05:35:41,619 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:41,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 05:35:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-18 05:35:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2023-02-18 05:35:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2023-02-18 05:35:41,634 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2023-02-18 05:35:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:41,635 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2023-02-18 05:35:41,636 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) [2023-02-18 05:35:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2023-02-18 05:35:41,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-18 05:35:41,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:41,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-18 05:35:41,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:41,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:41,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2023-02-18 05:35:41,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:41,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12897397] [2023-02-18 05:35:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:41,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:41,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:41,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:41,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-18 05:35:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:41,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 05:35:41,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:41,937 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:41,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:41,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:41,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12897397] [2023-02-18 05:35:41,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12897397] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:41,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:41,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:35:41,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565418084] [2023-02-18 05:35:41,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:41,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:35:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:35:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:41,942 INFO L87 Difference]: Start difference. First operand 186 states and 199 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) [2023-02-18 05:35:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:42,143 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2023-02-18 05:35:42,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:35:42,143 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 [2023-02-18 05:35:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:42,144 INFO L225 Difference]: With dead ends: 209 [2023-02-18 05:35:42,144 INFO L226 Difference]: Without dead ends: 209 [2023-02-18 05:35:42,144 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 [2023-02-18 05:35:42,145 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:42,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 232 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:35:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-18 05:35:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2023-02-18 05:35:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2023-02-18 05:35:42,150 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2023-02-18 05:35:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:42,151 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2023-02-18 05:35:42,151 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) [2023-02-18 05:35:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2023-02-18 05:35:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-18 05:35:42,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:42,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-18 05:35:42,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:42,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:42,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:42,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2023-02-18 05:35:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:42,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209424878] [2023-02-18 05:35:42,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:42,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:42,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:42,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-18 05:35:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:42,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 05:35:42,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:42,414 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:42,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:42,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:42,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209424878] [2023-02-18 05:35:42,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209424878] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:42,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:42,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:35:42,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484491627] [2023-02-18 05:35:42,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:42,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:35:42,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:42,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:35:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:42,420 INFO L87 Difference]: Start difference. First operand 184 states and 196 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) [2023-02-18 05:35:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:42,673 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-18 05:35:42,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:35:42,674 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 [2023-02-18 05:35:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:42,675 INFO L225 Difference]: With dead ends: 182 [2023-02-18 05:35:42,675 INFO L226 Difference]: Without dead ends: 182 [2023-02-18 05:35:42,675 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 [2023-02-18 05:35:42,676 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:42,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:35:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-18 05:35:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-18 05:35:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2023-02-18 05:35:42,681 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 5 [2023-02-18 05:35:42,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:42,681 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2023-02-18 05:35:42,681 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) [2023-02-18 05:35:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2023-02-18 05:35:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-18 05:35:42,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:42,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:42,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:42,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:42,890 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2023-02-18 05:35:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:42,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2476052] [2023-02-18 05:35:42,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:42,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:42,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:42,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:42,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-18 05:35:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:42,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 05:35:42,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:42,954 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:42,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:42,962 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:35:42,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-18 05:35:42,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-18 05:35:42,990 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:42,992 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:42,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:42,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:42,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2476052] [2023-02-18 05:35:42,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2476052] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:42,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:42,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 05:35:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528596145] [2023-02-18 05:35:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:42,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:35:42,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:43,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:35:43,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:35:43,000 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:43,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:43,364 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2023-02-18 05:35:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:35:43,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-18 05:35:43,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:43,365 INFO L225 Difference]: With dead ends: 184 [2023-02-18 05:35:43,366 INFO L226 Difference]: Without dead ends: 184 [2023-02-18 05:35:43,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:35:43,366 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 6 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:43,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 606 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:35:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-18 05:35:43,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2023-02-18 05:35:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2023-02-18 05:35:43,371 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2023-02-18 05:35:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:43,371 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2023-02-18 05:35:43,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2023-02-18 05:35:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-18 05:35:43,372 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:43,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:43,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:43,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:43,579 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2023-02-18 05:35:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:43,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905411348] [2023-02-18 05:35:43,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:43,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:43,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:43,586 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:43,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-18 05:35:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:43,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 05:35:43,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:43,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:43,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:43,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905411348] [2023-02-18 05:35:43,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905411348] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:43,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:43,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 05:35:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008019617] [2023-02-18 05:35:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:43,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:35:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:43,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:35:43,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:35:43,668 INFO L87 Difference]: Start difference. First operand 183 states and 194 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:43,695 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2023-02-18 05:35:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:35:43,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-18 05:35:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:43,697 INFO L225 Difference]: With dead ends: 260 [2023-02-18 05:35:43,697 INFO L226 Difference]: Without dead ends: 260 [2023-02-18 05:35:43,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:35:43,698 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 81 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:43,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 548 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:35:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-18 05:35:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2023-02-18 05:35:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2023-02-18 05:35:43,703 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2023-02-18 05:35:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:43,703 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2023-02-18 05:35:43,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2023-02-18 05:35:43,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 05:35:43,704 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:43,704 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:43,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:43,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:43,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:43,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:43,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2023-02-18 05:35:43,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:43,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049595565] [2023-02-18 05:35:43,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:43,914 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:43,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-18 05:35:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:43,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 05:35:43,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:43,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:43,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 05:35:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:43,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:43,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:43,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049595565] [2023-02-18 05:35:43,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049595565] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:43,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:43,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:35:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830573678] [2023-02-18 05:35:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:43,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:35:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:43,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:35:43,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:43,984 INFO L87 Difference]: Start difference. First operand 224 states and 275 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:44,199 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2023-02-18 05:35:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:35:44,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-18 05:35:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:44,201 INFO L225 Difference]: With dead ends: 227 [2023-02-18 05:35:44,201 INFO L226 Difference]: Without dead ends: 227 [2023-02-18 05:35:44,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:44,201 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:44,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:35:44,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-18 05:35:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2023-02-18 05:35:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2023-02-18 05:35:44,205 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 13 [2023-02-18 05:35:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:44,205 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2023-02-18 05:35:44,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2023-02-18 05:35:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-18 05:35:44,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:44,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:44,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-02-18 05:35:44,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:44,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:44,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2023-02-18 05:35:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:44,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575762168] [2023-02-18 05:35:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:44,416 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:44,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-18 05:35:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:44,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 05:35:44,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:44,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:35:44,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-18 05:35:44,494 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-18 05:35:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:44,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:44,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:44,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575762168] [2023-02-18 05:35:44,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575762168] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:44,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:44,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:35:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95886845] [2023-02-18 05:35:44,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:44,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:35:44,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:44,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:35:44,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:44,497 INFO L87 Difference]: Start difference. First operand 218 states and 265 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:44,764 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2023-02-18 05:35:44,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:35:44,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-18 05:35:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:44,765 INFO L225 Difference]: With dead ends: 239 [2023-02-18 05:35:44,766 INFO L226 Difference]: Without dead ends: 239 [2023-02-18 05:35:44,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:44,766 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:44,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 212 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:35:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-18 05:35:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2023-02-18 05:35:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2023-02-18 05:35:44,770 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 13 [2023-02-18 05:35:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:44,770 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2023-02-18 05:35:44,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2023-02-18 05:35:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 05:35:44,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:44,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:44,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:44,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:44,977 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:44,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2023-02-18 05:35:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:44,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210502850] [2023-02-18 05:35:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:44,983 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:44,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-18 05:35:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:45,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 05:35:45,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:45,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:45,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 05:35:45,087 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:45,119 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 19 [2023-02-18 05:35:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:45,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:45,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:45,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210502850] [2023-02-18 05:35:45,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210502850] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:45,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:45,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 05:35:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269712328] [2023-02-18 05:35:45,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:45,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 05:35:45,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:45,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 05:35:45,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:35:45,127 INFO L87 Difference]: Start difference. First operand 219 states and 259 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:45,539 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2023-02-18 05:35:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 05:35:45,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-18 05:35:45,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:45,541 INFO L225 Difference]: With dead ends: 270 [2023-02-18 05:35:45,541 INFO L226 Difference]: Without dead ends: 270 [2023-02-18 05:35:45,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 05:35:45,542 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:45,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 408 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 05:35:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-18 05:35:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2023-02-18 05:35:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2023-02-18 05:35:45,546 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 17 [2023-02-18 05:35:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:45,546 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2023-02-18 05:35:45,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2023-02-18 05:35:45,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 05:35:45,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:45,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:45,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-02-18 05:35:45,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:45,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:45,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2023-02-18 05:35:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:45,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808407107] [2023-02-18 05:35:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:45,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:45,756 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:45,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-18 05:35:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:45,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 05:35:45,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:45,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:45,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 05:35:45,873 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:45,885 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:45,904 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 19 [2023-02-18 05:35:45,908 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:45,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:45,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:45,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808407107] [2023-02-18 05:35:45,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808407107] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:45,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:45,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:35:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941329074] [2023-02-18 05:35:45,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:45,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:35:45,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:35:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:35:45,918 INFO L87 Difference]: Start difference. First operand 225 states and 269 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:46,386 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2023-02-18 05:35:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 05:35:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-18 05:35:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:46,387 INFO L225 Difference]: With dead ends: 227 [2023-02-18 05:35:46,387 INFO L226 Difference]: Without dead ends: 227 [2023-02-18 05:35:46,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:35:46,388 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:46,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 421 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 05:35:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-18 05:35:46,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2023-02-18 05:35:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 states have internal predecessors, (261), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2023-02-18 05:35:46,392 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2023-02-18 05:35:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:46,392 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2023-02-18 05:35:46,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:46,392 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2023-02-18 05:35:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 05:35:46,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:46,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:46,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:46,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:46,602 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:46,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:46,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2023-02-18 05:35:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:46,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658044027] [2023-02-18 05:35:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:46,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:46,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:46,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:46,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-18 05:35:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:46,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 05:35:46,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:46,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:46,728 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 32 [2023-02-18 05:35:46,743 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:46,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:46,773 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 76 [2023-02-18 05:35:46,793 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 32 [2023-02-18 05:35:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 05:35:46,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:35:46,829 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_178) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1))) is different from false [2023-02-18 05:35:46,835 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_178) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2023-02-18 05:35:46,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:46,857 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:46,859 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:46,861 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 5 [2023-02-18 05:35:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-18 05:35:46,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658044027] [2023-02-18 05:35:46,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658044027] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:35:46,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:35:46,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-02-18 05:35:46,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275731512] [2023-02-18 05:35:46,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:35:46,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 05:35:46,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:46,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 05:35:46,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2023-02-18 05:35:46,876 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:47,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:47,444 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2023-02-18 05:35:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:35:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-18 05:35:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:47,452 INFO L225 Difference]: With dead ends: 232 [2023-02-18 05:35:47,453 INFO L226 Difference]: Without dead ends: 232 [2023-02-18 05:35:47,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2023-02-18 05:35:47,453 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 47 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:47,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 609 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 210 Unchecked, 0.5s Time] [2023-02-18 05:35:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-18 05:35:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2023-02-18 05:35:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2023-02-18 05:35:47,457 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2023-02-18 05:35:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:47,457 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2023-02-18 05:35:47,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2023-02-18 05:35:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-18 05:35:47,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:47,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:47,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:47,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:47,661 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:47,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2023-02-18 05:35:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:47,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130490643] [2023-02-18 05:35:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:47,662 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:47,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:47,663 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:47,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-18 05:35:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:47,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 05:35:47,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:47,770 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-18 05:35:47,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-02-18 05:35:47,783 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:47,786 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:47,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:47,812 INFO L350 Elim1Store]: Elim1 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 59 [2023-02-18 05:35:47,817 INFO L350 Elim1Store]: Elim1 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 22 [2023-02-18 05:35:47,839 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:47,845 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:47,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:35:47,967 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse1 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32))))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_224) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse0) .cse1))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse0) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))))) is different from false [2023-02-18 05:35:47,989 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-02-18 05:35:48,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd (_ bv1 32) (_ bv0 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-02-18 05:35:48,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:48,023 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 52 [2023-02-18 05:35:48,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:48,027 INFO L350 Elim1Store]: Elim1 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 41 treesize of output 42 [2023-02-18 05:35:48,041 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 62 [2023-02-18 05:35:48,044 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 102 [2023-02-18 05:35:48,049 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 44 [2023-02-18 05:35:48,050 INFO L350 Elim1Store]: Elim1 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 90 treesize of output 82 [2023-02-18 05:35:48,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:48,065 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 29 [2023-02-18 05:35:48,069 INFO L350 Elim1Store]: Elim1 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 36 [2023-02-18 05:35:48,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:48,074 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 46 [2023-02-18 05:35:48,078 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 56 [2023-02-18 05:35:48,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-18 05:35:48,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:48,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130490643] [2023-02-18 05:35:48,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130490643] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:35:48,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:35:48,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-18 05:35:48,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673209108] [2023-02-18 05:35:48,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:35:48,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 05:35:48,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:48,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 05:35:48,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-02-18 05:35:48,200 INFO L87 Difference]: Start difference. First operand 224 states and 263 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:50,130 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2023-02-18 05:35:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 05:35:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-18 05:35:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:50,131 INFO L225 Difference]: With dead ends: 236 [2023-02-18 05:35:50,132 INFO L226 Difference]: Without dead ends: 236 [2023-02-18 05:35:50,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=179, Unknown=3, NotChecked=90, Total=342 [2023-02-18 05:35:50,132 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 6 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:50,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 917 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 511 Invalid, 0 Unknown, 262 Unchecked, 1.8s Time] [2023-02-18 05:35:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-18 05:35:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-02-18 05:35:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2023-02-18 05:35:50,136 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2023-02-18 05:35:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:50,136 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2023-02-18 05:35:50,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2023-02-18 05:35:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 05:35:50,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:50,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:50,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:50,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:50,338 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:50,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:50,338 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2023-02-18 05:35:50,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:50,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761147348] [2023-02-18 05:35:50,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 05:35:50,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:50,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:50,340 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:50,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 05:35:50,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 05:35:50,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:35:50,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 05:35:50,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:50,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:50,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 05:35:50,529 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-18 05:35:50,538 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:50,541 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:50,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:50,568 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 73 [2023-02-18 05:35:50,572 INFO L350 Elim1Store]: Elim1 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 22 [2023-02-18 05:35:50,609 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:50,609 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 73 [2023-02-18 05:35:50,614 INFO L350 Elim1Store]: Elim1 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 22 [2023-02-18 05:35:50,645 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 23 [2023-02-18 05:35:50,648 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:50,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:35:50,774 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset)) (.cse1 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32))))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse0)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0) .cse1))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0) .cse1))))) is different from false [2023-02-18 05:35:50,793 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd c_create_data_~counter~0 (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-02-18 05:35:50,812 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse1 (bvmul (_ bv4 32) (bvadd (bvadd c_create_data_~counter~0 (_ bv1 32)) (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_286) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-02-18 05:35:50,852 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) (bvadd (bvadd c_create_data_~counter~0 (_ bv1 32)) (_ bv1 32)))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2)) (_ bv4 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))))) is different from false [2023-02-18 05:35:50,880 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd (bvadd c_create_data_~counter~0 (_ bv1 32)) (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_285) c_create_data_~data~0.base) .cse2)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse2))) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_286) c_create_data_~data~0.base) .cse2))))))))) is different from false [2023-02-18 05:35:50,938 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (bvmul (_ bv4 32) (bvadd (bvadd (_ bv1 32) (_ bv0 32)) (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_286) c_create_data_~data~0.base) .cse3)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse3) v_ArrVal_285) c_create_data_~data~0.base) .cse3)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse3) v_ArrVal_285) c_create_data_~data~0.base) .cse3)))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2023-02-18 05:35:50,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:50,953 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 53 [2023-02-18 05:35:50,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:50,957 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 43 [2023-02-18 05:35:50,960 INFO L350 Elim1Store]: Elim1 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 76 treesize of output 64 [2023-02-18 05:35:50,962 INFO L350 Elim1Store]: Elim1 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 170 treesize of output 152 [2023-02-18 05:35:50,964 INFO L350 Elim1Store]: Elim1 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 106 treesize of output 90 [2023-02-18 05:35:50,966 INFO L350 Elim1Store]: Elim1 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 132 treesize of output 120 [2023-02-18 05:35:50,970 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 78 [2023-02-18 05:35:50,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:50,983 INFO L350 Elim1Store]: Elim1 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 103 treesize of output 94 [2023-02-18 05:35:50,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:50,987 INFO L350 Elim1Store]: Elim1 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 83 treesize of output 74 [2023-02-18 05:35:50,992 INFO L350 Elim1Store]: Elim1 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 130 treesize of output 112 [2023-02-18 05:35:50,995 INFO L350 Elim1Store]: Elim1 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 258 treesize of output 228 [2023-02-18 05:35:51,003 INFO L350 Elim1Store]: Elim1 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 158 treesize of output 142 [2023-02-18 05:35:51,005 INFO L350 Elim1Store]: Elim1 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 208 treesize of output 184 [2023-02-18 05:35:51,011 INFO L350 Elim1Store]: Elim1 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 126 treesize of output 118 [2023-02-18 05:35:51,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:51,020 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 98 [2023-02-18 05:35:51,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:51,025 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 68 [2023-02-18 05:35:51,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:35:51,031 INFO L350 Elim1Store]: Elim1 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 108 treesize of output 72 [2023-02-18 05:35:51,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:35:51,035 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 48 [2023-02-18 05:35:51,041 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-18 05:35:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-02-18 05:35:51,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:51,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761147348] [2023-02-18 05:35:51,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761147348] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:35:51,081 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:35:51,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-02-18 05:35:51,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201950052] [2023-02-18 05:35:51,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:35:51,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 05:35:51,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:51,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 05:35:51,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2023-02-18 05:35:51,082 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:53,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:53,111 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2023-02-18 05:35:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 05:35:53,112 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-18 05:35:53,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:53,113 INFO L225 Difference]: With dead ends: 246 [2023-02-18 05:35:53,113 INFO L226 Difference]: Without dead ends: 246 [2023-02-18 05:35:53,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=265, Unknown=6, NotChecked=234, Total=600 [2023-02-18 05:35:53,114 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 7 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:53,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1338 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 719 Invalid, 0 Unknown, 570 Unchecked, 1.8s Time] [2023-02-18 05:35:53,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-18 05:35:53,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2023-02-18 05:35:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2023-02-18 05:35:53,118 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 27 [2023-02-18 05:35:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:53,118 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2023-02-18 05:35:53,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2023-02-18 05:35:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 05:35:53,118 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:53,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:53,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:53,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:53,329 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash 852563911, now seen corresponding path program 3 times [2023-02-18 05:35:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:53,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252870539] [2023-02-18 05:35:53,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 05:35:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:53,333 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:53,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-18 05:35:53,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-18 05:35:53,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 05:35:53,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 05:35:53,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:53,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:35:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 05:35:53,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:53,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252870539] [2023-02-18 05:35:53,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252870539] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:35:53,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:35:53,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 05:35:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121645120] [2023-02-18 05:35:53,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:35:53,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 05:35:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:53,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 05:35:53,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 05:35:53,636 INFO L87 Difference]: Start difference. First operand 244 states and 283 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:53,708 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2023-02-18 05:35:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:35:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-18 05:35:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:53,710 INFO L225 Difference]: With dead ends: 241 [2023-02-18 05:35:53,710 INFO L226 Difference]: Without dead ends: 241 [2023-02-18 05:35:53,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 05:35:53,710 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 94 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:53,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 1123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 05:35:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-18 05:35:53,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2023-02-18 05:35:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 states have internal predecessors, (271), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 275 transitions. [2023-02-18 05:35:53,714 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 275 transitions. Word has length 32 [2023-02-18 05:35:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:53,714 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 275 transitions. [2023-02-18 05:35:53,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 275 transitions. [2023-02-18 05:35:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-18 05:35:53,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:53,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:53,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:53,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:53,925 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:53,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:53,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829061, now seen corresponding path program 1 times [2023-02-18 05:35:53,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:53,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101392071] [2023-02-18 05:35:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:53,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:53,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:53,933 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:53,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-18 05:35:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:54,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 05:35:54,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:54,088 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:35:54,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:54,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:54,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101392071] [2023-02-18 05:35:54,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101392071] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:54,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:54,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:35:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024541269] [2023-02-18 05:35:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:54,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:35:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:35:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:54,092 INFO L87 Difference]: Start difference. First operand 239 states and 275 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:54,252 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2023-02-18 05:35:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:35:54,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-18 05:35:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:54,253 INFO L225 Difference]: With dead ends: 241 [2023-02-18 05:35:54,254 INFO L226 Difference]: Without dead ends: 241 [2023-02-18 05:35:54,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:54,254 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:54,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:35:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-18 05:35:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2023-02-18 05:35:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 states have internal predecessors, (259), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 263 transitions. [2023-02-18 05:35:54,258 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 263 transitions. Word has length 41 [2023-02-18 05:35:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:54,258 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 263 transitions. [2023-02-18 05:35:54,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2023-02-18 05:35:54,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-18 05:35:54,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:54,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:54,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-18 05:35:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:54,459 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829060, now seen corresponding path program 1 times [2023-02-18 05:35:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:54,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300629351] [2023-02-18 05:35:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:54,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:54,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:54,461 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:54,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-18 05:35:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:54,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 05:35:54,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:54,601 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:35:54,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:54,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:54,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300629351] [2023-02-18 05:35:54,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300629351] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:54,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:35:54,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 05:35:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211871522] [2023-02-18 05:35:54,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:54,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 05:35:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 05:35:54,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:54,604 INFO L87 Difference]: Start difference. First operand 235 states and 263 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:35:54,824 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2023-02-18 05:35:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 05:35:54,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-02-18 05:35:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:35:54,825 INFO L225 Difference]: With dead ends: 237 [2023-02-18 05:35:54,825 INFO L226 Difference]: Without dead ends: 237 [2023-02-18 05:35:54,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 05:35:54,826 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:35:54,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:35:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-18 05:35:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2023-02-18 05:35:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:35:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2023-02-18 05:35:54,831 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 41 [2023-02-18 05:35:54,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:35:54,832 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2023-02-18 05:35:54,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:35:54,832 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2023-02-18 05:35:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 05:35:54,837 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:35:54,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:35:54,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-02-18 05:35:55,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:55,047 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:35:55,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:35:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash -663465002, now seen corresponding path program 1 times [2023-02-18 05:35:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:35:55,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825467974] [2023-02-18 05:35:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:55,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:35:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:35:55,049 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:35:55,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-18 05:35:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:55,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 05:35:55,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:55,284 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:55,295 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:55,321 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:35:55,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:55,351 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 20 treesize of output 74 [2023-02-18 05:35:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 05:35:55,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:35:59,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:35:59,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825467974] [2023-02-18 05:35:59,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825467974] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:35:59,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [395692530] [2023-02-18 05:35:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:35:59,453 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:35:59,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:35:59,454 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:35:59,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-18 05:35:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:35:59,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 05:35:59,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:35:59,820 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:35:59,826 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-18 05:35:59,889 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:35:59,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:35:59,889 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 53 [2023-02-18 05:35:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:35:59,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:35:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [395692530] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:35:59,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:35:59,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-02-18 05:35:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945828086] [2023-02-18 05:35:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:35:59,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:35:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:35:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:35:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=64, Unknown=3, NotChecked=16, Total=110 [2023-02-18 05:35:59,901 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:35:59,969 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_#valid| create_data_~data~0.base) (_ bv1 1)) (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |c_#valid|)))) (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)) |c_#valid|))) is different from true [2023-02-18 05:36:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:00,501 INFO L93 Difference]: Finished difference Result 284 states and 313 transitions. [2023-02-18 05:36:00,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 05:36:00,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-02-18 05:36:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:00,503 INFO L225 Difference]: With dead ends: 284 [2023-02-18 05:36:00,503 INFO L226 Difference]: Without dead ends: 284 [2023-02-18 05:36:00,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=33, Invalid=81, Unknown=4, NotChecked=38, Total=156 [2023-02-18 05:36:00,503 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:00,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 276 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 225 Unchecked, 0.6s Time] [2023-02-18 05:36:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-18 05:36:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2023-02-18 05:36:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 05:36:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 285 transitions. [2023-02-18 05:36:00,507 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 285 transitions. Word has length 44 [2023-02-18 05:36:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:00,507 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 285 transitions. [2023-02-18 05:36:00,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 285 transitions. [2023-02-18 05:36:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-18 05:36:00,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:00,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:00,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:00,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:00,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:00,913 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:00,913 INFO L85 PathProgramCache]: Analyzing trace with hash -663465001, now seen corresponding path program 1 times [2023-02-18 05:36:00,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:00,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321257182] [2023-02-18 05:36:00,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:00,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:00,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:00,915 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:00,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-18 05:36:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:01,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 05:36:01,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:01,187 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:01,200 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:01,235 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:01,250 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:36:01,252 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_54 (_ BitVec 32)) (v_ArrVal_886 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_54 (_ bv80 32)) |c_#length|))) is different from true [2023-02-18 05:36:01,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:01,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:01,281 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:36:01,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:01,287 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-18 05:36:01,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:01,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:01,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321257182] [2023-02-18 05:36:01,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321257182] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:01,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725577664] [2023-02-18 05:36:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:01,360 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:01,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:36:01,362 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:36:01,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-18 05:36:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:01,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 05:36:01,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:01,773 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:01,774 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:01,791 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_1002 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1002) |c_create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-18 05:36:01,793 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_1002 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1002) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|))) is different from true [2023-02-18 05:36:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:01,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:01,829 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:36:01,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:01,833 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:01,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:01,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [725577664] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:01,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:36:01,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2023-02-18 05:36:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179912808] [2023-02-18 05:36:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:01,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 05:36:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:01,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 05:36:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=73, Unknown=3, NotChecked=54, Total=156 [2023-02-18 05:36:01,853 INFO L87 Difference]: Start difference. First operand 255 states and 285 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:02,561 INFO L93 Difference]: Finished difference Result 380 states and 416 transitions. [2023-02-18 05:36:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 05:36:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-02-18 05:36:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:02,562 INFO L225 Difference]: With dead ends: 380 [2023-02-18 05:36:02,562 INFO L226 Difference]: Without dead ends: 380 [2023-02-18 05:36:02,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=87, Unknown=3, NotChecked=60, Total=182 [2023-02-18 05:36:02,563 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 148 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 489 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:02,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 384 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 481 Invalid, 1 Unknown, 489 Unchecked, 0.7s Time] [2023-02-18 05:36:02,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2023-02-18 05:36:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 258. [2023-02-18 05:36:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 200 states have (on average 1.4) internal successors, (280), 250 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 05:36:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 287 transitions. [2023-02-18 05:36:02,567 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 287 transitions. Word has length 44 [2023-02-18 05:36:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:02,567 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 287 transitions. [2023-02-18 05:36:02,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 287 transitions. [2023-02-18 05:36:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 05:36:02,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:02,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:02,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:02,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:02,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:02,981 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1359492877, now seen corresponding path program 1 times [2023-02-18 05:36:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536477905] [2023-02-18 05:36:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:02,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:02,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:02,983 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:02,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-18 05:36:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:03,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:36:03,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:03,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:36:03,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:36:03,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 05:36:03,218 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 39 [2023-02-18 05:36:03,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:03,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-02-18 05:36:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:03,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:03,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536477905] [2023-02-18 05:36:03,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536477905] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:03,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:03,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 05:36:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229556679] [2023-02-18 05:36:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:03,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:36:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:03,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:36:03,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:36:03,247 INFO L87 Difference]: Start difference. First operand 258 states and 287 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:03,504 INFO L93 Difference]: Finished difference Result 296 states and 331 transitions. [2023-02-18 05:36:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 05:36:03,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-18 05:36:03,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:03,506 INFO L225 Difference]: With dead ends: 296 [2023-02-18 05:36:03,506 INFO L226 Difference]: Without dead ends: 296 [2023-02-18 05:36:03,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-18 05:36:03,506 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:03,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 706 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:36:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-18 05:36:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2023-02-18 05:36:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 208 states have (on average 1.3846153846153846) internal successors, (288), 258 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 05:36:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 295 transitions. [2023-02-18 05:36:03,518 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 295 transitions. Word has length 46 [2023-02-18 05:36:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:03,518 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 295 transitions. [2023-02-18 05:36:03,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 295 transitions. [2023-02-18 05:36:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 05:36:03,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:03,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:03,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:03,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:03,730 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:03,730 INFO L85 PathProgramCache]: Analyzing trace with hash 918765395, now seen corresponding path program 1 times [2023-02-18 05:36:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:03,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616051542] [2023-02-18 05:36:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:03,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:03,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:03,732 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:03,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-18 05:36:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:03,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 05:36:03,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:03,932 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:03,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:03,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616051542] [2023-02-18 05:36:03,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616051542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:03,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:03,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 05:36:03,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621836794] [2023-02-18 05:36:03,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:03,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:36:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:03,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:36:03,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:36:03,933 INFO L87 Difference]: Start difference. First operand 266 states and 295 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:03,949 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2023-02-18 05:36:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:36:03,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-18 05:36:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:03,950 INFO L225 Difference]: With dead ends: 274 [2023-02-18 05:36:03,950 INFO L226 Difference]: Without dead ends: 274 [2023-02-18 05:36:03,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:36:03,961 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:03,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 455 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 05:36:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-18 05:36:03,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2023-02-18 05:36:03,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 214 states have (on average 1.355140186915888) internal successors, (290), 264 states have internal predecessors, (290), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-18 05:36:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2023-02-18 05:36:03,966 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 46 [2023-02-18 05:36:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:03,966 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2023-02-18 05:36:03,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:03,966 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2023-02-18 05:36:03,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 05:36:03,967 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:03,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:04,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:04,175 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703003, now seen corresponding path program 1 times [2023-02-18 05:36:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:04,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175347035] [2023-02-18 05:36:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:04,176 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:04,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:04,178 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:04,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-18 05:36:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:04,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 05:36:04,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:04,433 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:04,444 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:04,454 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:36:04,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:04,499 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 20 treesize of output 74 [2023-02-18 05:36:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 05:36:04,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:08,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175347035] [2023-02-18 05:36:08,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175347035] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [921252995] [2023-02-18 05:36:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:08,646 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:08,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:36:08,648 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:36:08,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-18 05:36:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:09,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:36:09,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:09,171 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-18 05:36:09,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:09,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:09,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:09,256 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 15 treesize of output 33 [2023-02-18 05:36:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:09,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:09,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [921252995] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:09,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:36:09,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-02-18 05:36:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989479167] [2023-02-18 05:36:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:09,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 05:36:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:09,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 05:36:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=170, Unknown=2, NotChecked=0, Total=210 [2023-02-18 05:36:09,328 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:12,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:36:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:12,605 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2023-02-18 05:36:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 05:36:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-18 05:36:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:12,609 INFO L225 Difference]: With dead ends: 360 [2023-02-18 05:36:12,609 INFO L226 Difference]: Without dead ends: 360 [2023-02-18 05:36:12,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=60, Invalid=244, Unknown=2, NotChecked=0, Total=306 [2023-02-18 05:36:12,610 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 523 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 19 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:12,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 374 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 406 Invalid, 18 Unknown, 0 Unchecked, 3.2s Time] [2023-02-18 05:36:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-02-18 05:36:12,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 283. [2023-02-18 05:36:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 223 states have (on average 1.3632286995515694) internal successors, (304), 273 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 05:36:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2023-02-18 05:36:12,615 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 46 [2023-02-18 05:36:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:12,615 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2023-02-18 05:36:12,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2023-02-18 05:36:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 05:36:12,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:12,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:12,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-02-18 05:36:12,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:13,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:13,025 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703002, now seen corresponding path program 1 times [2023-02-18 05:36:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:13,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810185719] [2023-02-18 05:36:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:13,027 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:13,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-18 05:36:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:13,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 05:36:13,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:13,314 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:13,337 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:13,352 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:36:13,354 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1554 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_70 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1554) v_arrayElimCell_70 (_ bv80 32)) |c_#length|))) is different from true [2023-02-18 05:36:13,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:13,385 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:13,385 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 17 treesize of output 49 [2023-02-18 05:36:13,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:13,391 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-18 05:36:13,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:13,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:13,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810185719] [2023-02-18 05:36:13,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810185719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:13,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1741531279] [2023-02-18 05:36:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:13,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:13,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:36:13,517 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:36:13,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-18 05:36:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:13,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 05:36:13,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:13,993 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:14,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:14,020 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:14,092 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:14,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:14,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:14,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:14,246 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 22 treesize of output 38 [2023-02-18 05:36:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:14,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:14,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1741531279] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:14,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:36:14,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-02-18 05:36:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208029062] [2023-02-18 05:36:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:14,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 05:36:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 05:36:14,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=4, NotChecked=30, Total=306 [2023-02-18 05:36:14,353 INFO L87 Difference]: Start difference. First operand 283 states and 313 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:16,039 INFO L93 Difference]: Finished difference Result 503 states and 553 transitions. [2023-02-18 05:36:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 05:36:16,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-18 05:36:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:16,041 INFO L225 Difference]: With dead ends: 503 [2023-02-18 05:36:16,041 INFO L226 Difference]: Without dead ends: 503 [2023-02-18 05:36:16,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=282, Unknown=6, NotChecked=34, Total=380 [2023-02-18 05:36:16,041 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 356 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 16 mSolverCounterUnsat, 119 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 119 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:16,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 439 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 409 Invalid, 119 Unknown, 0 Unchecked, 1.6s Time] [2023-02-18 05:36:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-02-18 05:36:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 437. [2023-02-18 05:36:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 370 states have (on average 1.3216216216216217) internal successors, (489), 420 states have internal predecessors, (489), 4 states have call successors, (4), 4 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-18 05:36:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 507 transitions. [2023-02-18 05:36:16,048 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 507 transitions. Word has length 46 [2023-02-18 05:36:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:16,048 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 507 transitions. [2023-02-18 05:36:16,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 507 transitions. [2023-02-18 05:36:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 05:36:16,048 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:16,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:16,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:16,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:16,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:16,449 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:16,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875696, now seen corresponding path program 1 times [2023-02-18 05:36:16,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:16,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967139594] [2023-02-18 05:36:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:16,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:16,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:16,460 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:16,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-18 05:36:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:16,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-18 05:36:16,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:16,797 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:16,810 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:16,822 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:36:16,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:16,854 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 20 treesize of output 74 [2023-02-18 05:36:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-18 05:36:16,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:18,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:18,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967139594] [2023-02-18 05:36:18,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967139594] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:18,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:36:18,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-02-18 05:36:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204009054] [2023-02-18 05:36:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:18,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:36:18,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:36:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:36:18,804 INFO L87 Difference]: Start difference. First operand 437 states and 507 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:19,111 INFO L93 Difference]: Finished difference Result 460 states and 527 transitions. [2023-02-18 05:36:19,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 05:36:19,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-18 05:36:19,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:19,113 INFO L225 Difference]: With dead ends: 460 [2023-02-18 05:36:19,113 INFO L226 Difference]: Without dead ends: 460 [2023-02-18 05:36:19,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:36:19,113 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:19,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:36:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-02-18 05:36:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 415. [2023-02-18 05:36:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 352 states have (on average 1.3096590909090908) internal successors, (461), 400 states have internal predecessors, (461), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 477 transitions. [2023-02-18 05:36:19,119 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 477 transitions. Word has length 48 [2023-02-18 05:36:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:19,119 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 477 transitions. [2023-02-18 05:36:19,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 477 transitions. [2023-02-18 05:36:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 05:36:19,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:19,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:19,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:19,320 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875697, now seen corresponding path program 1 times [2023-02-18 05:36:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:19,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029935274] [2023-02-18 05:36:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:19,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:19,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:19,322 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:19,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-18 05:36:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:19,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 05:36:19,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:19,687 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:19,709 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:19,724 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:19,738 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:36:19,740 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_1892 (_ BitVec 32)) (v_arrayElimCell_80 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1892) v_arrayElimCell_80 (_ bv80 32)) |c_#length|))) is different from true [2023-02-18 05:36:19,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:19,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:19,758 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:36:19,763 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:19,763 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-18 05:36:19,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:19,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:19,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029935274] [2023-02-18 05:36:19,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029935274] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:19,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1191186453] [2023-02-18 05:36:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:19,827 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:19,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:36:19,828 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:36:19,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-02-18 05:36:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:20,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 05:36:20,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:20,323 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:20,325 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:20,331 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_2006 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_2006) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-18 05:36:20,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:20,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:20,354 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:36:20,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:20,360 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:20,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:20,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1191186453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:20,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:36:20,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-18 05:36:20,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586258351] [2023-02-18 05:36:20,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:20,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 05:36:20,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 05:36:20,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=72, Unknown=2, NotChecked=34, Total=132 [2023-02-18 05:36:20,377 INFO L87 Difference]: Start difference. First operand 415 states and 477 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:21,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:21,068 INFO L93 Difference]: Finished difference Result 600 states and 697 transitions. [2023-02-18 05:36:21,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 05:36:21,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-18 05:36:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:21,070 INFO L225 Difference]: With dead ends: 600 [2023-02-18 05:36:21,070 INFO L226 Difference]: Without dead ends: 600 [2023-02-18 05:36:21,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=103, Unknown=2, NotChecked=42, Total=182 [2023-02-18 05:36:21,071 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 230 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:21,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 480 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 508 Invalid, 1 Unknown, 319 Unchecked, 0.7s Time] [2023-02-18 05:36:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-02-18 05:36:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 421. [2023-02-18 05:36:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 358 states have (on average 1.3100558659217878) internal successors, (469), 406 states have internal predecessors, (469), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 485 transitions. [2023-02-18 05:36:21,077 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 485 transitions. Word has length 48 [2023-02-18 05:36:21,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:21,077 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 485 transitions. [2023-02-18 05:36:21,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 485 transitions. [2023-02-18 05:36:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 05:36:21,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:21,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:21,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-02-18 05:36:21,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:21,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:21,489 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:21,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:21,490 INFO L85 PathProgramCache]: Analyzing trace with hash 471257990, now seen corresponding path program 1 times [2023-02-18 05:36:21,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:21,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773589878] [2023-02-18 05:36:21,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:21,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:21,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:21,492 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:21,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-18 05:36:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:21,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 05:36:21,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:21,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:21,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:21,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773589878] [2023-02-18 05:36:21,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773589878] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:21,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:21,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 05:36:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532028646] [2023-02-18 05:36:21,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:21,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:36:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:21,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:36:21,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:36:21,751 INFO L87 Difference]: Start difference. First operand 421 states and 485 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:21,989 INFO L93 Difference]: Finished difference Result 420 states and 483 transitions. [2023-02-18 05:36:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:36:21,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-18 05:36:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:21,991 INFO L225 Difference]: With dead ends: 420 [2023-02-18 05:36:21,991 INFO L226 Difference]: Without dead ends: 420 [2023-02-18 05:36:21,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:36:21,992 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:21,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 215 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:36:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-02-18 05:36:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2023-02-18 05:36:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 358 states have (on average 1.3044692737430168) internal successors, (467), 405 states have internal predecessors, (467), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 483 transitions. [2023-02-18 05:36:22,000 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 483 transitions. Word has length 48 [2023-02-18 05:36:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:22,000 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 483 transitions. [2023-02-18 05:36:22,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:22,000 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 483 transitions. [2023-02-18 05:36:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-18 05:36:22,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:22,001 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:22,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:22,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:22,211 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 471257991, now seen corresponding path program 1 times [2023-02-18 05:36:22,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:22,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61939963] [2023-02-18 05:36:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:22,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:22,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:22,218 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:22,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-18 05:36:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:22,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 05:36:22,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:22,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:22,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:22,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61939963] [2023-02-18 05:36:22,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61939963] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:22,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:22,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 05:36:22,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753175144] [2023-02-18 05:36:22,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:22,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 05:36:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 05:36:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:36:22,446 INFO L87 Difference]: Start difference. First operand 420 states and 483 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:22,742 INFO L93 Difference]: Finished difference Result 411 states and 471 transitions. [2023-02-18 05:36:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:36:22,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-18 05:36:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:22,744 INFO L225 Difference]: With dead ends: 411 [2023-02-18 05:36:22,744 INFO L226 Difference]: Without dead ends: 411 [2023-02-18 05:36:22,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:36:22,745 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 143 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:22,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 210 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:36:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-02-18 05:36:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2023-02-18 05:36:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 358 states have (on average 1.270949720670391) internal successors, (455), 396 states have internal predecessors, (455), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 471 transitions. [2023-02-18 05:36:22,753 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 471 transitions. Word has length 48 [2023-02-18 05:36:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:22,754 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 471 transitions. [2023-02-18 05:36:22,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 471 transitions. [2023-02-18 05:36:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-18 05:36:22,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:22,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:22,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:22,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:22,965 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095953, now seen corresponding path program 1 times [2023-02-18 05:36:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:22,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449141389] [2023-02-18 05:36:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:22,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:22,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:22,978 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:23,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-18 05:36:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:23,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:36:23,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:23,233 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:23,238 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:23,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:23,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:23,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449141389] [2023-02-18 05:36:23,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449141389] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:23,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:23,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:36:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997953693] [2023-02-18 05:36:23,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:36:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:23,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:36:23,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:36:23,244 INFO L87 Difference]: Start difference. First operand 411 states and 471 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:23,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:23,577 INFO L93 Difference]: Finished difference Result 432 states and 492 transitions. [2023-02-18 05:36:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:36:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2023-02-18 05:36:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:23,578 INFO L225 Difference]: With dead ends: 432 [2023-02-18 05:36:23,578 INFO L226 Difference]: Without dead ends: 432 [2023-02-18 05:36:23,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:36:23,579 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 147 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:23,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 357 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:36:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-02-18 05:36:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 410. [2023-02-18 05:36:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 358 states have (on average 1.26536312849162) internal successors, (453), 395 states have internal predecessors, (453), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:23,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 469 transitions. [2023-02-18 05:36:23,584 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 469 transitions. Word has length 49 [2023-02-18 05:36:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:23,584 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 469 transitions. [2023-02-18 05:36:23,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 469 transitions. [2023-02-18 05:36:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-18 05:36:23,584 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:23,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:23,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-02-18 05:36:23,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:23,793 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:23,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095954, now seen corresponding path program 1 times [2023-02-18 05:36:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:23,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242590922] [2023-02-18 05:36:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:23,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:23,795 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:23,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-18 05:36:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:24,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 05:36:24,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:24,034 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:24,042 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:24,063 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-18 05:36:24,065 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:24,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:24,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:24,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:24,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242590922] [2023-02-18 05:36:24,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242590922] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:24,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:24,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:36:24,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121575293] [2023-02-18 05:36:24,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:24,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:36:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:36:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:36:24,073 INFO L87 Difference]: Start difference. First operand 410 states and 469 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:24,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:24,412 INFO L93 Difference]: Finished difference Result 448 states and 507 transitions. [2023-02-18 05:36:24,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:36:24,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2023-02-18 05:36:24,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:24,413 INFO L225 Difference]: With dead ends: 448 [2023-02-18 05:36:24,413 INFO L226 Difference]: Without dead ends: 448 [2023-02-18 05:36:24,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:36:24,414 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 283 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:24,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 305 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:36:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-02-18 05:36:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 409. [2023-02-18 05:36:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 358 states have (on average 1.2597765363128492) internal successors, (451), 394 states have internal predecessors, (451), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 467 transitions. [2023-02-18 05:36:24,421 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 467 transitions. Word has length 49 [2023-02-18 05:36:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:24,421 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 467 transitions. [2023-02-18 05:36:24,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 467 transitions. [2023-02-18 05:36:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 05:36:24,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:24,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:24,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:24,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:24,632 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -42553449, now seen corresponding path program 1 times [2023-02-18 05:36:24,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:24,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316092006] [2023-02-18 05:36:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:24,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:24,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:24,634 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:24,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-18 05:36:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:24,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:36:24,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:24,874 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:24,878 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:24,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:24,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:24,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316092006] [2023-02-18 05:36:24,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316092006] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:24,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:24,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:36:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973097069] [2023-02-18 05:36:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:24,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:36:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:24,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:36:24,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:36:24,884 INFO L87 Difference]: Start difference. First operand 409 states and 467 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:25,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:25,228 INFO L93 Difference]: Finished difference Result 432 states and 490 transitions. [2023-02-18 05:36:25,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:36:25,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-18 05:36:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:25,229 INFO L225 Difference]: With dead ends: 432 [2023-02-18 05:36:25,229 INFO L226 Difference]: Without dead ends: 432 [2023-02-18 05:36:25,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:36:25,230 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 179 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:25,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 326 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:36:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2023-02-18 05:36:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 408. [2023-02-18 05:36:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 358 states have (on average 1.2541899441340782) internal successors, (449), 393 states have internal predecessors, (449), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 465 transitions. [2023-02-18 05:36:25,235 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 465 transitions. Word has length 53 [2023-02-18 05:36:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:25,236 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 465 transitions. [2023-02-18 05:36:25,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 465 transitions. [2023-02-18 05:36:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 05:36:25,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:25,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:25,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:25,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:25,437 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:25,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:25,438 INFO L85 PathProgramCache]: Analyzing trace with hash -42553448, now seen corresponding path program 1 times [2023-02-18 05:36:25,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:25,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859371782] [2023-02-18 05:36:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:25,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:25,439 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:25,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-18 05:36:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:25,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 05:36:25,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:25,701 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:25,704 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:25,716 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:25,718 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-18 05:36:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:25,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:25,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:25,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859371782] [2023-02-18 05:36:25,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859371782] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:25,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:25,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:36:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758144413] [2023-02-18 05:36:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:25,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:36:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:36:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:36:25,737 INFO L87 Difference]: Start difference. First operand 408 states and 465 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:26,209 INFO L93 Difference]: Finished difference Result 448 states and 505 transitions. [2023-02-18 05:36:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:36:26,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-18 05:36:26,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:26,211 INFO L225 Difference]: With dead ends: 448 [2023-02-18 05:36:26,211 INFO L226 Difference]: Without dead ends: 448 [2023-02-18 05:36:26,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:36:26,211 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 266 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:26,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 308 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 05:36:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-02-18 05:36:26,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 407. [2023-02-18 05:36:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 358 states have (on average 1.2486033519553073) internal successors, (447), 392 states have internal predecessors, (447), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 463 transitions. [2023-02-18 05:36:26,216 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 463 transitions. Word has length 53 [2023-02-18 05:36:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:26,217 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 463 transitions. [2023-02-18 05:36:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 463 transitions. [2023-02-18 05:36:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 05:36:26,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:26,217 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:26,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:26,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:26,425 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting create_dataErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982670, now seen corresponding path program 1 times [2023-02-18 05:36:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:26,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049434315] [2023-02-18 05:36:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:26,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:26,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:26,428 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:26,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-02-18 05:36:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:26,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 05:36:26,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:26,874 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:26,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:26,878 INFO L350 Elim1Store]: Elim1 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 28 [2023-02-18 05:36:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:26,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:26,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049434315] [2023-02-18 05:36:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049434315] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:36:26,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:36:26,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-18 05:36:26,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692853173] [2023-02-18 05:36:26,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:36:26,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 05:36:26,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:26,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 05:36:26,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 05:36:26,893 INFO L87 Difference]: Start difference. First operand 407 states and 463 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:36:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:27,096 INFO L93 Difference]: Finished difference Result 406 states and 461 transitions. [2023-02-18 05:36:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 05:36:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-18 05:36:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:27,098 INFO L225 Difference]: With dead ends: 406 [2023-02-18 05:36:27,098 INFO L226 Difference]: Without dead ends: 406 [2023-02-18 05:36:27,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:36:27,098 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:27,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 238 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:36:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-02-18 05:36:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2023-02-18 05:36:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 358 states have (on average 1.2430167597765363) internal successors, (445), 391 states have internal predecessors, (445), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:27,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 461 transitions. [2023-02-18 05:36:27,109 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 461 transitions. Word has length 53 [2023-02-18 05:36:27,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:27,110 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 461 transitions. [2023-02-18 05:36:27,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:36:27,110 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 461 transitions. [2023-02-18 05:36:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-18 05:36:27,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:27,111 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:27,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:27,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:27,325 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting create_dataErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:27,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982671, now seen corresponding path program 1 times [2023-02-18 05:36:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:27,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442616835] [2023-02-18 05:36:27,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:27,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:27,327 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:27,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-18 05:36:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:27,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 05:36:27,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:27,750 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:27,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:27,766 INFO L350 Elim1Store]: Elim1 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 28 [2023-02-18 05:36:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:27,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:27,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442616835] [2023-02-18 05:36:27,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442616835] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:36:27,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:36:27,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-02-18 05:36:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622793353] [2023-02-18 05:36:27,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:36:27,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 05:36:27,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 05:36:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-18 05:36:27,855 INFO L87 Difference]: Start difference. First operand 406 states and 461 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:36:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:28,313 INFO L93 Difference]: Finished difference Result 402 states and 453 transitions. [2023-02-18 05:36:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 05:36:28,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-18 05:36:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:28,314 INFO L225 Difference]: With dead ends: 402 [2023-02-18 05:36:28,314 INFO L226 Difference]: Without dead ends: 402 [2023-02-18 05:36:28,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:36:28,315 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:28,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 312 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 05:36:28,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-02-18 05:36:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 388. [2023-02-18 05:36:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 344 states have (on average 1.2296511627906976) internal successors, (423), 373 states have internal predecessors, (423), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 439 transitions. [2023-02-18 05:36:28,319 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 439 transitions. Word has length 53 [2023-02-18 05:36:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:28,319 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 439 transitions. [2023-02-18 05:36:28,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 05:36:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 439 transitions. [2023-02-18 05:36:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 05:36:28,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:28,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:28,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-02-18 05:36:28,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:28,520 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156755, now seen corresponding path program 1 times [2023-02-18 05:36:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:28,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874674395] [2023-02-18 05:36:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:28,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:28,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:28,523 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:28,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-18 05:36:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:28,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 05:36:28,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:28,892 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:28,905 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:28,908 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:28,909 INFO L350 Elim1Store]: Elim1 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 36 [2023-02-18 05:36:28,962 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:28,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:28,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 136 treesize of output 237 [2023-02-18 05:36:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 05:36:40,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:40,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:40,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874674395] [2023-02-18 05:36:40,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874674395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:40,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:40,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 05:36:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350327937] [2023-02-18 05:36:40,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:40,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 05:36:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 05:36:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 05:36:40,033 INFO L87 Difference]: Start difference. First operand 388 states and 439 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:41,130 INFO L93 Difference]: Finished difference Result 467 states and 539 transitions. [2023-02-18 05:36:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 05:36:41,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2023-02-18 05:36:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:41,132 INFO L225 Difference]: With dead ends: 467 [2023-02-18 05:36:41,132 INFO L226 Difference]: Without dead ends: 467 [2023-02-18 05:36:41,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-02-18 05:36:41,133 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 219 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:41,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 588 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-18 05:36:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-02-18 05:36:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 406. [2023-02-18 05:36:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 362 states have (on average 1.2320441988950277) internal successors, (446), 391 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 462 transitions. [2023-02-18 05:36:41,138 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 462 transitions. Word has length 54 [2023-02-18 05:36:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:41,139 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 462 transitions. [2023-02-18 05:36:41,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 462 transitions. [2023-02-18 05:36:41,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 05:36:41,147 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:41,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:41,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-02-18 05:36:41,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:41,358 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:41,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156754, now seen corresponding path program 1 times [2023-02-18 05:36:41,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:41,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054327308] [2023-02-18 05:36:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:41,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:41,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:41,361 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:41,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-02-18 05:36:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:41,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-18 05:36:41,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:41,761 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:41,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:41,766 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:41,807 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:41,811 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:41,830 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:41,848 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:41,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:41,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 69 [2023-02-18 05:36:41,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:41,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2023-02-18 05:36:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:41,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:41,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:41,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054327308] [2023-02-18 05:36:41,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054327308] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:41,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:41,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 05:36:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278232422] [2023-02-18 05:36:41,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:41,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 05:36:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:41,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 05:36:41,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-18 05:36:41,937 INFO L87 Difference]: Start difference. First operand 406 states and 462 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:43,269 INFO L93 Difference]: Finished difference Result 516 states and 572 transitions. [2023-02-18 05:36:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 05:36:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2023-02-18 05:36:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:43,272 INFO L225 Difference]: With dead ends: 516 [2023-02-18 05:36:43,272 INFO L226 Difference]: Without dead ends: 516 [2023-02-18 05:36:43,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-02-18 05:36:43,273 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 391 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:43,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 602 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-18 05:36:43,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2023-02-18 05:36:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 406. [2023-02-18 05:36:43,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 362 states have (on average 1.2265193370165746) internal successors, (444), 391 states have internal predecessors, (444), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 460 transitions. [2023-02-18 05:36:43,299 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 460 transitions. Word has length 54 [2023-02-18 05:36:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:43,299 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 460 transitions. [2023-02-18 05:36:43,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:43,299 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 460 transitions. [2023-02-18 05:36:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-18 05:36:43,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:43,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:43,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:43,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:43,514 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1610777396, now seen corresponding path program 1 times [2023-02-18 05:36:43,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:43,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847856425] [2023-02-18 05:36:43,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:43,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:43,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:43,517 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:43,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-18 05:36:44,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:44,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 05:36:44,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:44,174 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:44,182 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:44,213 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515)))) is different from true [2023-02-18 05:36:44,233 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)))) is different from true [2023-02-18 05:36:44,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:44,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:44,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:44,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:44,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-18 05:36:44,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:44,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-18 05:36:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-18 05:36:44,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:44,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:44,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847856425] [2023-02-18 05:36:44,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847856425] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:44,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1826205755] [2023-02-18 05:36:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:44,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:44,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:36:44,322 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:36:44,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-02-18 05:36:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:45,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 05:36:45,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:45,307 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:45,310 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:45,397 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3719 (_ BitVec 32)) (v_ArrVal_3717 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3717) |create_data_#t~malloc7.base| v_ArrVal_3719) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) is different from true [2023-02-18 05:36:45,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:45,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:45,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:45,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:45,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-18 05:36:45,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:45,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-18 05:36:45,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-18 05:36:45,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:45,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1826205755] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:45,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:36:45,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-02-18 05:36:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821165073] [2023-02-18 05:36:45,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:36:45,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 05:36:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:45,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 05:36:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=72, Unknown=3, NotChecked=54, Total=156 [2023-02-18 05:36:45,985 INFO L87 Difference]: Start difference. First operand 406 states and 460 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:36:46,073 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_3515 (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |c_create_data_#t~malloc7.base| v_ArrVal_3515))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |c_create_data_#t~malloc7.base|)))) (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515))))) is different from true [2023-02-18 05:36:46,078 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515)))) (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (exists ((v_ArrVal_3719 (_ BitVec 32)) (v_ArrVal_3717 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3717) |create_data_#t~malloc7.base| v_ArrVal_3719)))))) is different from true [2023-02-18 05:36:46,101 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3719 (_ BitVec 32)) (v_ArrVal_3717 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3717) |create_data_#t~malloc7.base| v_ArrVal_3719) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) (exists ((v_ArrVal_3515 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_3516 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3516) |create_data_#t~malloc7.base| v_ArrVal_3515) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|))))) is different from true [2023-02-18 05:36:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:46,952 INFO L93 Difference]: Finished difference Result 565 states and 636 transitions. [2023-02-18 05:36:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 05:36:46,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-02-18 05:36:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:46,954 INFO L225 Difference]: With dead ends: 565 [2023-02-18 05:36:46,954 INFO L226 Difference]: Without dead ends: 565 [2023-02-18 05:36:46,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=106, Unknown=6, NotChecked=150, Total=306 [2023-02-18 05:36:46,954 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 198 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 5 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:46,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 705 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 533 Invalid, 35 Unknown, 830 Unchecked, 0.9s Time] [2023-02-18 05:36:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2023-02-18 05:36:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 427. [2023-02-18 05:36:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 382 states have (on average 1.2225130890052356) internal successors, (467), 411 states have internal predecessors, (467), 4 states have call successors, (4), 4 states have call predecessors, (4), 11 states have return successors, (14), 11 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-18 05:36:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 485 transitions. [2023-02-18 05:36:46,962 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 485 transitions. Word has length 55 [2023-02-18 05:36:46,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:46,962 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 485 transitions. [2023-02-18 05:36:46,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:36:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 485 transitions. [2023-02-18 05:36:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-18 05:36:46,963 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:46,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:46,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:47,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:47,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:47,381 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:47,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:47,381 INFO L85 PathProgramCache]: Analyzing trace with hash 948367783, now seen corresponding path program 1 times [2023-02-18 05:36:47,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:47,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391293082] [2023-02-18 05:36:47,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:47,383 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:47,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-02-18 05:36:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:47,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 05:36:47,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:47,754 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:47,757 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:47,773 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:47,794 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:36:47,797 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3849 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3849) v_arrayElimCell_122 (_ bv80 32)) |c_#length|))) is different from true [2023-02-18 05:36:47,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:47,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:47,822 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:36:47,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:47,827 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2023-02-18 05:36:47,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:47,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391293082] [2023-02-18 05:36:47,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391293082] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:47,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1886915204] [2023-02-18 05:36:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:47,908 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:47,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:36:47,909 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:36:47,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-02-18 05:36:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:48,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 05:36:48,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:48,583 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:48,585 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:48,594 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_3978 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3978) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-18 05:36:48,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:48,621 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:48,621 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:36:48,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:48,626 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-18 05:36:48,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:48,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1886915204] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:48,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:36:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-18 05:36:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318366000] [2023-02-18 05:36:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:48,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 05:36:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 05:36:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=72, Unknown=2, NotChecked=34, Total=132 [2023-02-18 05:36:48,641 INFO L87 Difference]: Start difference. First operand 427 states and 485 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:49,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:49,152 INFO L93 Difference]: Finished difference Result 531 states and 599 transitions. [2023-02-18 05:36:49,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 05:36:49,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-02-18 05:36:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:49,154 INFO L225 Difference]: With dead ends: 531 [2023-02-18 05:36:49,154 INFO L226 Difference]: Without dead ends: 531 [2023-02-18 05:36:49,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=86, Unknown=2, NotChecked=38, Total=156 [2023-02-18 05:36:49,155 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 120 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:49,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 344 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 244 Unchecked, 0.5s Time] [2023-02-18 05:36:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-02-18 05:36:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 407. [2023-02-18 05:36:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 364 states have (on average 1.217032967032967) internal successors, (443), 393 states have internal predecessors, (443), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 459 transitions. [2023-02-18 05:36:49,161 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 459 transitions. Word has length 56 [2023-02-18 05:36:49,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:49,161 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 459 transitions. [2023-02-18 05:36:49,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 459 transitions. [2023-02-18 05:36:49,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 05:36:49,162 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:49,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:49,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:49,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2023-02-18 05:36:49,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:49,568 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1897094198, now seen corresponding path program 1 times [2023-02-18 05:36:49,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:49,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022276260] [2023-02-18 05:36:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:49,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:49,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:49,571 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:49,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2023-02-18 05:36:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:49,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:36:49,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:49,858 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:49,863 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:49,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:49,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:49,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022276260] [2023-02-18 05:36:49,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022276260] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:49,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:49,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:36:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789183941] [2023-02-18 05:36:49,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:49,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 05:36:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:49,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 05:36:49,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 05:36:49,870 INFO L87 Difference]: Start difference. First operand 407 states and 459 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:50,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:50,072 INFO L93 Difference]: Finished difference Result 445 states and 497 transitions. [2023-02-18 05:36:50,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 05:36:50,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-18 05:36:50,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:50,075 INFO L225 Difference]: With dead ends: 445 [2023-02-18 05:36:50,075 INFO L226 Difference]: Without dead ends: 445 [2023-02-18 05:36:50,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 05:36:50,076 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 151 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:50,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 353 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 05:36:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-18 05:36:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 409. [2023-02-18 05:36:50,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 366 states have (on average 1.215846994535519) internal successors, (445), 395 states have internal predecessors, (445), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 461 transitions. [2023-02-18 05:36:50,080 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 461 transitions. Word has length 57 [2023-02-18 05:36:50,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:50,080 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 461 transitions. [2023-02-18 05:36:50,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:50,089 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 461 transitions. [2023-02-18 05:36:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 05:36:50,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:50,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:50,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:50,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:50,290 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:50,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093746, now seen corresponding path program 1 times [2023-02-18 05:36:50,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:50,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719857896] [2023-02-18 05:36:50,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:50,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:50,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:50,292 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:50,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2023-02-18 05:36:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:50,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:36:50,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:50,579 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:50,584 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:50,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:50,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:50,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719857896] [2023-02-18 05:36:50,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719857896] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:50,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:36:50,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:36:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019700583] [2023-02-18 05:36:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:50,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:36:50,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:36:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:36:50,589 INFO L87 Difference]: Start difference. First operand 409 states and 461 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:50,951 INFO L93 Difference]: Finished difference Result 427 states and 479 transitions. [2023-02-18 05:36:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 05:36:50,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-18 05:36:50,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:50,952 INFO L225 Difference]: With dead ends: 427 [2023-02-18 05:36:50,952 INFO L226 Difference]: Without dead ends: 427 [2023-02-18 05:36:50,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 05:36:50,953 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 118 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:50,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 338 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 05:36:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-02-18 05:36:50,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 411. [2023-02-18 05:36:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 368 states have (on average 1.2173913043478262) internal successors, (448), 397 states have internal predecessors, (448), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 464 transitions. [2023-02-18 05:36:50,969 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 464 transitions. Word has length 57 [2023-02-18 05:36:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:50,969 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 464 transitions. [2023-02-18 05:36:50,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 464 transitions. [2023-02-18 05:36:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 05:36:50,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:50,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:50,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (47)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:51,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:51,179 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:51,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:51,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093745, now seen corresponding path program 1 times [2023-02-18 05:36:51,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:51,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294878215] [2023-02-18 05:36:51,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:51,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:51,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:51,182 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:51,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-02-18 05:36:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:51,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 05:36:51,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:51,602 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:51,604 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:51,620 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:51,634 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:36:51,636 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32)) (v_ArrVal_4328 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4328) v_arrayElimCell_131 (_ bv80 32)) |c_#length|))) is different from true [2023-02-18 05:36:51,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:51,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:51,653 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:36:51,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:51,659 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:36:51,680 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:51,683 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:51,715 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 38 [2023-02-18 05:36:51,718 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-18 05:36:51,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:36:51,799 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2023-02-18 05:36:51,801 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 90 [2023-02-18 05:36:51,813 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-18 05:36:51,820 INFO L350 Elim1Store]: Elim1 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 36 [2023-02-18 05:36:54,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:36:54,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294878215] [2023-02-18 05:36:54,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294878215] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:36:54,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [918876212] [2023-02-18 05:36:54,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:54,902 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:36:54,903 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:36:54,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-02-18 05:36:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:36:55,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 05:36:55,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:36:55,827 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:55,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:36:55,890 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:55,893 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:56,013 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:36:56,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:36:56,169 INFO L350 Elim1Store]: Elim1 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 22 [2023-02-18 05:36:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:36:56,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:36:56,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [918876212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:36:56,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:36:56,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2023-02-18 05:36:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458220972] [2023-02-18 05:36:56,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:36:56,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 05:36:56,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:36:56,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 05:36:56,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=456, Unknown=2, NotChecked=42, Total=552 [2023-02-18 05:36:56,467 INFO L87 Difference]: Start difference. First operand 411 states and 464 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:59,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:36:59,300 INFO L93 Difference]: Finished difference Result 536 states and 605 transitions. [2023-02-18 05:36:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 05:36:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-18 05:36:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:36:59,303 INFO L225 Difference]: With dead ends: 536 [2023-02-18 05:36:59,303 INFO L226 Difference]: Without dead ends: 536 [2023-02-18 05:36:59,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=142, Invalid=982, Unknown=2, NotChecked=64, Total=1190 [2023-02-18 05:36:59,303 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 447 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-18 05:36:59,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 784 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-18 05:36:59,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-18 05:36:59,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 411. [2023-02-18 05:36:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 368 states have (on average 1.2119565217391304) internal successors, (446), 397 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 05:36:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 462 transitions. [2023-02-18 05:36:59,310 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 462 transitions. Word has length 57 [2023-02-18 05:36:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:36:59,310 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 462 transitions. [2023-02-18 05:36:59,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:36:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 462 transitions. [2023-02-18 05:36:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 05:36:59,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:36:59,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:36:59,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2023-02-18 05:36:59,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Ended with exit code 0 [2023-02-18 05:36:59,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 05:36:59,722 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:36:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:36:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854146, now seen corresponding path program 1 times [2023-02-18 05:36:59,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:36:59,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400157908] [2023-02-18 05:36:59,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:36:59,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:36:59,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:36:59,724 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:36:59,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2023-02-18 05:37:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:37:00,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 05:37:00,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:37:00,321 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-18 05:37:00,344 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:37:00,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:00,390 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 64 [2023-02-18 05:37:00,392 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 36 [2023-02-18 05:37:00,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:00,420 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 64 [2023-02-18 05:37:00,424 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 36 [2023-02-18 05:37:00,452 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 21 [2023-02-18 05:37:00,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:00,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:00,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 32 treesize of output 124 [2023-02-18 05:37:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 05:37:01,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:37:01,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:37:01,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400157908] [2023-02-18 05:37:01,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400157908] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:37:01,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1556374212] [2023-02-18 05:37:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:37:01,799 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:37:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:37:01,800 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:37:01,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2023-02-18 05:37:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:37:02,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 05:37:02,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:37:02,643 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-18 05:37:02,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:02,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:02,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:02,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:02,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 18 treesize of output 68 [2023-02-18 05:37:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:37:03,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:37:03,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1556374212] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:37:03,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:37:03,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2023-02-18 05:37:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582576698] [2023-02-18 05:37:03,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:37:03,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 05:37:03,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:37:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 05:37:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-18 05:37:03,493 INFO L87 Difference]: Start difference. First operand 411 states and 462 transitions. Second operand has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:37:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:37:16,710 INFO L93 Difference]: Finished difference Result 514 states and 574 transitions. [2023-02-18 05:37:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 05:37:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2023-02-18 05:37:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:37:16,736 INFO L225 Difference]: With dead ends: 514 [2023-02-18 05:37:16,736 INFO L226 Difference]: Without dead ends: 514 [2023-02-18 05:37:16,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=130, Invalid=571, Unknown=1, NotChecked=0, Total=702 [2023-02-18 05:37:16,736 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 439 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 30 mSolverCounterUnsat, 51 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 51 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:37:16,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 590 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 747 Invalid, 51 Unknown, 0 Unchecked, 8.4s Time] [2023-02-18 05:37:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-02-18 05:37:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 441. [2023-02-18 05:37:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.2045454545454546) internal successors, (477), 426 states have internal predecessors, (477), 4 states have call successors, (4), 4 states have call predecessors, (4), 11 states have return successors, (16), 10 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-18 05:37:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 497 transitions. [2023-02-18 05:37:16,742 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 497 transitions. Word has length 57 [2023-02-18 05:37:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:37:16,743 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 497 transitions. [2023-02-18 05:37:16,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:37:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 497 transitions. [2023-02-18 05:37:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-18 05:37:16,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:37:16,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:37:16,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Ended with exit code 0 [2023-02-18 05:37:16,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Ended with exit code 0 [2023-02-18 05:37:17,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:37:17,153 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:37:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:37:17,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854147, now seen corresponding path program 1 times [2023-02-18 05:37:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:37:17,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669745804] [2023-02-18 05:37:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:37:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:37:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:37:17,158 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:37:17,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2023-02-18 05:37:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:37:17,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 05:37:17,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:37:17,715 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:37:17,720 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:37:17,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:17,731 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:37:17,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:17,737 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:37:17,757 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-18 05:37:17,761 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-18 05:37:17,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:17,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:17,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:17,875 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 18 treesize of output 82 [2023-02-18 05:37:17,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:17,883 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:37:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:37:17,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:37:18,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:37:18,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669745804] [2023-02-18 05:37:18,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669745804] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:37:18,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1670416192] [2023-02-18 05:37:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:37:18,064 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:37:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:37:18,065 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:37:18,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2023-02-18 05:37:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:37:18,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 05:37:18,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:37:18,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:37:18,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:18,983 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:37:19,059 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:37:25,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:25,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:25,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:37:25,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:37:25,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 73 [2023-02-18 05:37:25,896 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:37:25,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:37:28,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1670416192] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:37:28,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:37:28,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-18 05:37:28,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934446350] [2023-02-18 05:37:28,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:37:28,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-18 05:37:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:37:28,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-18 05:37:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=281, Unknown=10, NotChecked=0, Total=342 [2023-02-18 05:37:28,121 INFO L87 Difference]: Start difference. First operand 441 states and 497 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:37:32,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:37:34,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:37:34,576 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_5062 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_5061 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5061) |create_data_#t~malloc7.base| v_ArrVal_5062) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) (exists ((v_ArrVal_5062 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_5061 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5061) |create_data_#t~malloc7.base| v_ArrVal_5062) |c_#length|))) (exists ((v_ArrVal_5263 (_ BitVec 32)) (v_ArrVal_5262 (_ BitVec 32)) (v_ArrVal_5261 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (bvult create_data_~data~0.base |c_#StackHeapBarrier|) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|) (bvult create_data_~nextData~0.base |c_#StackHeapBarrier|) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5262) |create_data_#t~malloc7.base| v_ArrVal_5261) create_data_~nextData~0.base v_ArrVal_5263)))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (exists ((v_ArrVal_5262 (_ BitVec 32)) (v_ArrVal_5261 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (bvult create_data_~data~0.base |c_#StackHeapBarrier|) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5262) |create_data_#t~malloc7.base| v_ArrVal_5261) |c_#length|)))) is different from true [2023-02-18 05:37:42,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:37:44,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:37:57,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:01,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:04,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:07,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:12,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:14,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:16,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:18,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:20,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:22,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:38:25,876 INFO L93 Difference]: Finished difference Result 793 states and 872 transitions. [2023-02-18 05:38:25,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 05:38:25,877 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2023-02-18 05:38:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:38:25,879 INFO L225 Difference]: With dead ends: 793 [2023-02-18 05:38:25,879 INFO L226 Difference]: Without dead ends: 793 [2023-02-18 05:38:25,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=203, Invalid=807, Unknown=50, NotChecked=62, Total=1122 [2023-02-18 05:38:25,879 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 692 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 42 mSolverCounterUnsat, 394 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 394 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 39.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:38:25,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 862 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1014 Invalid, 394 Unknown, 1 Unchecked, 39.5s Time] [2023-02-18 05:38:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2023-02-18 05:38:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 480. [2023-02-18 05:38:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 434 states have (on average 1.195852534562212) internal successors, (519), 463 states have internal predecessors, (519), 4 states have call successors, (4), 4 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-18 05:38:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 537 transitions. [2023-02-18 05:38:25,894 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 537 transitions. Word has length 57 [2023-02-18 05:38:25,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:38:25,894 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 537 transitions. [2023-02-18 05:38:25,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 05:38:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 537 transitions. [2023-02-18 05:38:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-18 05:38:25,894 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:38:25,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:38:25,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Forceful destruction successful, exit code 0 [2023-02-18 05:38:26,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (52)] Ended with exit code 0 [2023-02-18 05:38:26,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:26,295 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:38:26,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:38:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2094859878, now seen corresponding path program 1 times [2023-02-18 05:38:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:38:26,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393698706] [2023-02-18 05:38:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:26,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:26,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:38:26,297 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:38:26,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2023-02-18 05:38:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:26,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 05:38:26,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:26,993 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:26,997 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:27,030 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|))) is different from true [2023-02-18 05:38:27,058 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) create_data_~nextData~0.base (_ bv16 32))))) is different from true [2023-02-18 05:38:27,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:27,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:27,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:27,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:27,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-18 05:38:27,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:27,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-18 05:38:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-18 05:38:27,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:38:27,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:38:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393698706] [2023-02-18 05:38:27,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393698706] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:38:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482723418] [2023-02-18 05:38:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:27,184 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:38:27,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:38:27,185 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:38:27,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2023-02-18 05:38:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:28,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 05:38:28,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:28,161 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:28,165 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:28,243 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_5658 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5657 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5658) |create_data_#t~malloc7.base| v_ArrVal_5657) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) is different from true [2023-02-18 05:38:28,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:28,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:28,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:28,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:28,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 18 treesize of output 66 [2023-02-18 05:38:28,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:28,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2023-02-18 05:38:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-18 05:38:28,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:38:32,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [482723418] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:38:32,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:38:32,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-02-18 05:38:32,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575739124] [2023-02-18 05:38:32,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:38:32,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 05:38:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:38:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 05:38:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=87, Unknown=5, NotChecked=60, Total=182 [2023-02-18 05:38:32,400 INFO L87 Difference]: Start difference. First operand 480 states and 537 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:38:32,531 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|))) (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_5457 (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |c_create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |c_create_data_#t~malloc7.base|))))) is different from true [2023-02-18 05:38:32,538 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) |c_#length|))) (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (exists ((v_ArrVal_5658 (_ BitVec 32)) (v_ArrVal_5657 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5658) |create_data_#t~malloc7.base| v_ArrVal_5657) |c_#length|))))) is different from true [2023-02-18 05:38:32,751 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5457 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5458 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5458) |create_data_#t~malloc7.base| v_ArrVal_5457) create_data_~nextData~0.base (_ bv16 32))))) (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_5658 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_5657 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5658) |create_data_#t~malloc7.base| v_ArrVal_5657) create_data_~nextData~0.base (_ bv16 32)) |c_#length|)))) is different from true [2023-02-18 05:38:35,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:37,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 05:38:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:38:38,285 INFO L93 Difference]: Finished difference Result 689 states and 771 transitions. [2023-02-18 05:38:38,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 05:38:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2023-02-18 05:38:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:38:38,293 INFO L225 Difference]: With dead ends: 689 [2023-02-18 05:38:38,293 INFO L226 Difference]: Without dead ends: 689 [2023-02-18 05:38:38,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=48, Invalid=124, Unknown=8, NotChecked=162, Total=342 [2023-02-18 05:38:38,294 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 191 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 5 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 852 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-18 05:38:38,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 698 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 537 Invalid, 50 Unknown, 852 Unchecked, 5.8s Time] [2023-02-18 05:38:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-02-18 05:38:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 486. [2023-02-18 05:38:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 440 states have (on average 1.1977272727272728) internal successors, (527), 469 states have internal predecessors, (527), 4 states have call successors, (4), 4 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-18 05:38:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 545 transitions. [2023-02-18 05:38:38,299 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 545 transitions. Word has length 59 [2023-02-18 05:38:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:38:38,299 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 545 transitions. [2023-02-18 05:38:38,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:38:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 545 transitions. [2023-02-18 05:38:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-18 05:38:38,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:38:38,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:38:38,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (54)] Forceful destruction successful, exit code 0 [2023-02-18 05:38:38,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Ended with exit code 0 [2023-02-18 05:38:38,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 05:38:38,726 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:38:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:38:38,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1611932791, now seen corresponding path program 1 times [2023-02-18 05:38:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:38:38,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739179740] [2023-02-18 05:38:38,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:38,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:38:38,728 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:38:38,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Waiting until timeout for monitored process [2023-02-18 05:38:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:39,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 05:38:39,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:39,366 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:39,371 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:39,410 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:39,444 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:38:39,450 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5786 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_175 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5786) v_arrayElimCell_175 (_ bv80 32)) |c_#length|))) is different from true [2023-02-18 05:38:39,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:39,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:39,474 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:38:39,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:39,484 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:38:39,513 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:39,540 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:39,589 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 38 [2023-02-18 05:38:39,592 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-18 05:38:39,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:38:39,708 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2023-02-18 05:38:39,729 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 90 [2023-02-18 05:38:39,759 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-18 05:38:39,774 INFO L350 Elim1Store]: Elim1 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 36 [2023-02-18 05:38:45,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:38:45,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739179740] [2023-02-18 05:38:45,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739179740] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:38:45,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [613891336] [2023-02-18 05:38:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:45,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:38:45,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:38:45,518 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:38:45,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2023-02-18 05:38:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:46,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 05:38:46,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:46,467 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:46,471 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:46,505 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_5915 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5915) |create_data_#t~malloc7.base| (_ bv80 32)))))) is different from true [2023-02-18 05:38:46,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:46,529 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:46,529 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:38:46,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:46,537 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:38:46,598 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:46,602 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:47,110 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 38 [2023-02-18 05:38:47,117 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:38:47,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:38:47,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [613891336] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:38:47,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:38:47,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-18 05:38:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509246714] [2023-02-18 05:38:47,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:38:47,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 05:38:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:38:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 05:38:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=254, Unknown=4, NotChecked=66, Total=380 [2023-02-18 05:38:47,142 INFO L87 Difference]: Start difference. First operand 486 states and 545 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:38:48,008 INFO L93 Difference]: Finished difference Result 725 states and 824 transitions. [2023-02-18 05:38:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 05:38:48,009 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2023-02-18 05:38:48,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:38:48,011 INFO L225 Difference]: With dead ends: 725 [2023-02-18 05:38:48,011 INFO L226 Difference]: Without dead ends: 725 [2023-02-18 05:38:48,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=88, Invalid=336, Unknown=4, NotChecked=78, Total=506 [2023-02-18 05:38:48,012 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 285 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-18 05:38:48,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 432 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 310 Invalid, 0 Unknown, 271 Unchecked, 0.7s Time] [2023-02-18 05:38:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2023-02-18 05:38:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 583. [2023-02-18 05:38:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 531 states have (on average 1.2109227871939736) internal successors, (643), 559 states have internal predecessors, (643), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (32), 19 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 05:38:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 683 transitions. [2023-02-18 05:38:48,022 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 683 transitions. Word has length 61 [2023-02-18 05:38:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:38:48,022 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 683 transitions. [2023-02-18 05:38:48,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:48,022 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 683 transitions. [2023-02-18 05:38:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 05:38:48,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:38:48,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:38:48,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (56)] Ended with exit code 0 [2023-02-18 05:38:48,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (57)] Ended with exit code 0 [2023-02-18 05:38:48,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 05:38:48,429 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:38:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:38:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash 939726753, now seen corresponding path program 1 times [2023-02-18 05:38:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:38:48,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291525582] [2023-02-18 05:38:48,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:48,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:48,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:38:48,431 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:38:48,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2023-02-18 05:38:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:48,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 05:38:48,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:48,806 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:48,819 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:38:48,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:38:48,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:38:48,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291525582] [2023-02-18 05:38:48,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291525582] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:38:48,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:38:48,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:38:48,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677759322] [2023-02-18 05:38:48,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:38:48,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:38:48,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:38:48,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:38:48,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:38:48,832 INFO L87 Difference]: Start difference. First operand 583 states and 683 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:38:49,362 INFO L93 Difference]: Finished difference Result 598 states and 697 transitions. [2023-02-18 05:38:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 05:38:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-02-18 05:38:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:38:49,370 INFO L225 Difference]: With dead ends: 598 [2023-02-18 05:38:49,370 INFO L226 Difference]: Without dead ends: 598 [2023-02-18 05:38:49,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 05:38:49,371 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:38:49,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 303 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 05:38:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2023-02-18 05:38:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 586. [2023-02-18 05:38:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 534 states have (on average 1.2116104868913857) internal successors, (647), 562 states have internal predecessors, (647), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (32), 19 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 05:38:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 687 transitions. [2023-02-18 05:38:49,380 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 687 transitions. Word has length 64 [2023-02-18 05:38:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:38:49,381 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 687 transitions. [2023-02-18 05:38:49,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 687 transitions. [2023-02-18 05:38:49,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-18 05:38:49,381 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:38:49,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:38:49,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (58)] Forceful destruction successful, exit code 0 [2023-02-18 05:38:49,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:49,592 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:38:49,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:38:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 939726754, now seen corresponding path program 1 times [2023-02-18 05:38:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:38:49,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883204850] [2023-02-18 05:38:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:49,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:49,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:38:49,594 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:38:49,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Waiting until timeout for monitored process [2023-02-18 05:38:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:49,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 05:38:49,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:50,004 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:50,007 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:50,018 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-18 05:38:50,020 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:38:50,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:38:50,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:38:50,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883204850] [2023-02-18 05:38:50,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883204850] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:38:50,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 05:38:50,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 05:38:50,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285799291] [2023-02-18 05:38:50,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:38:50,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 05:38:50,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:38:50,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 05:38:50,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-18 05:38:50,029 INFO L87 Difference]: Start difference. First operand 586 states and 687 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:50,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:38:50,526 INFO L93 Difference]: Finished difference Result 614 states and 713 transitions. [2023-02-18 05:38:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 05:38:50,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-02-18 05:38:50,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:38:50,528 INFO L225 Difference]: With dead ends: 614 [2023-02-18 05:38:50,529 INFO L226 Difference]: Without dead ends: 614 [2023-02-18 05:38:50,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-18 05:38:50,529 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 156 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-18 05:38:50,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 327 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-18 05:38:50,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2023-02-18 05:38:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 586. [2023-02-18 05:38:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 534 states have (on average 1.2097378277153559) internal successors, (646), 562 states have internal predecessors, (646), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (32), 19 states have call predecessors, (32), 8 states have call successors, (32) [2023-02-18 05:38:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 686 transitions. [2023-02-18 05:38:50,534 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 686 transitions. Word has length 64 [2023-02-18 05:38:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:38:50,534 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 686 transitions. [2023-02-18 05:38:50,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 686 transitions. [2023-02-18 05:38:50,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 05:38:50,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:38:50,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:38:50,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (59)] Forceful destruction successful, exit code 0 [2023-02-18 05:38:50,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:50,748 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:38:50,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:38:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash 504851823, now seen corresponding path program 1 times [2023-02-18 05:38:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:38:50,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738896307] [2023-02-18 05:38:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:50,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:50,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:38:50,751 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:38:50,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2023-02-18 05:38:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:51,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 05:38:51,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:51,274 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:51,277 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:51,297 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:51,319 INFO L350 Elim1Store]: Elim1 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 9 [2023-02-18 05:38:51,323 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_193 (_ BitVec 32)) (v_ArrVal_6272 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6272) v_arrayElimCell_193 (_ bv80 32))))) is different from true [2023-02-18 05:38:51,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:51,359 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:51,359 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:38:51,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:51,367 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:38:51,390 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:51,394 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:51,465 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 38 [2023-02-18 05:38:51,471 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-18 05:38:51,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:38:51,619 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2023-02-18 05:38:51,623 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 90 [2023-02-18 05:38:51,643 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-18 05:38:51,658 INFO L350 Elim1Store]: Elim1 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 36 [2023-02-18 05:38:53,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:38:53,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738896307] [2023-02-18 05:38:53,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738896307] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 05:38:53,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1396639812] [2023-02-18 05:38:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 05:38:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 05:38:53,817 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 05:38:53,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2023-02-18 05:38:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:54,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 05:38:54,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:54,807 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:54,813 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:54,851 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_6402 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6402) |create_data_#t~malloc7.base| (_ bv80 32)))))) is different from true [2023-02-18 05:38:54,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 05:38:54,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:54,910 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 15 treesize of output 47 [2023-02-18 05:38:54,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:54,919 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:38:55,009 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:55,014 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:55,900 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 38 [2023-02-18 05:38:55,902 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:38:55,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 05:38:55,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1396639812] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 05:38:55,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 05:38:55,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-18 05:38:55,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555610960] [2023-02-18 05:38:55,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 05:38:55,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 05:38:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:38:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 05:38:55,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2023-02-18 05:38:55,949 INFO L87 Difference]: Start difference. First operand 586 states and 686 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:38:57,311 INFO L93 Difference]: Finished difference Result 791 states and 917 transitions. [2023-02-18 05:38:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 05:38:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2023-02-18 05:38:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:38:57,314 INFO L225 Difference]: With dead ends: 791 [2023-02-18 05:38:57,314 INFO L226 Difference]: Without dead ends: 791 [2023-02-18 05:38:57,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=88, Invalid=338, Unknown=2, NotChecked=78, Total=506 [2023-02-18 05:38:57,314 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 249 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-18 05:38:57,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 630 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 561 Invalid, 1 Unknown, 351 Unchecked, 1.2s Time] [2023-02-18 05:38:57,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2023-02-18 05:38:57,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 620. [2023-02-18 05:38:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 566 states have (on average 1.2031802120141342) internal successors, (681), 594 states have internal predecessors, (681), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 21 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-18 05:38:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 725 transitions. [2023-02-18 05:38:57,322 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 725 transitions. Word has length 65 [2023-02-18 05:38:57,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:38:57,322 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 725 transitions. [2023-02-18 05:38:57,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 05:38:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 725 transitions. [2023-02-18 05:38:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 05:38:57,323 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:38:57,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:38:57,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (60)] Ended with exit code 0 [2023-02-18 05:38:57,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (61)] Forceful destruction successful, exit code 0 [2023-02-18 05:38:57,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 05:38:57,724 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:38:57,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:38:57,724 INFO L85 PathProgramCache]: Analyzing trace with hash -665539789, now seen corresponding path program 1 times [2023-02-18 05:38:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:38:57,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618652046] [2023-02-18 05:38:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:38:57,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:38:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:38:57,726 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:38:57,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Waiting until timeout for monitored process [2023-02-18 05:38:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:38:58,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-18 05:38:58,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:38:58,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:58,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-18 05:38:58,263 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:38:58,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:58,273 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 59 [2023-02-18 05:38:58,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:58,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 76 treesize of output 126 [2023-02-18 05:38:58,343 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 32 [2023-02-18 05:38:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:38:58,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:38:58,454 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-18 05:38:58,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:38:58,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 178 [2023-02-18 05:38:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:38:58,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 05:38:58,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618652046] [2023-02-18 05:38:58,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618652046] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 05:38:58,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 05:38:58,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2023-02-18 05:38:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950137249] [2023-02-18 05:38:58,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 05:38:58,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-18 05:38:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 05:38:58,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-18 05:38:58,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-02-18 05:38:58,523 INFO L87 Difference]: Start difference. First operand 620 states and 725 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:39:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 05:39:00,079 INFO L93 Difference]: Finished difference Result 631 states and 738 transitions. [2023-02-18 05:39:00,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 05:39:00,080 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-02-18 05:39:00,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 05:39:00,081 INFO L225 Difference]: With dead ends: 631 [2023-02-18 05:39:00,081 INFO L226 Difference]: Without dead ends: 631 [2023-02-18 05:39:00,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2023-02-18 05:39:00,082 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 244 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-18 05:39:00,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 683 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-18 05:39:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2023-02-18 05:39:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 619. [2023-02-18 05:39:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 566 states have (on average 1.196113074204947) internal successors, (677), 593 states have internal predecessors, (677), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 21 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-18 05:39:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 721 transitions. [2023-02-18 05:39:00,088 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 721 transitions. Word has length 65 [2023-02-18 05:39:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 05:39:00,088 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 721 transitions. [2023-02-18 05:39:00,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 05:39:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 721 transitions. [2023-02-18 05:39:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-18 05:39:00,089 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 05:39:00,089 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 05:39:00,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (62)] Forceful destruction successful, exit code 0 [2023-02-18 05:39:00,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:39:00,292 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-18 05:39:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 05:39:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash -665539788, now seen corresponding path program 1 times [2023-02-18 05:39:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 05:39:00,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53686407] [2023-02-18 05:39:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 05:39:00,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 05:39:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 05:39:00,294 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 05:39:00,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (63)] Waiting until timeout for monitored process [2023-02-18 05:39:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 05:39:00,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-18 05:39:00,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 05:39:00,838 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:39:00,843 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:39:00,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:39:00,866 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 19 [2023-02-18 05:39:00,872 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-18 05:39:00,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:39:00,902 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 56 [2023-02-18 05:39:00,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:39:00,912 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 48 [2023-02-18 05:39:00,946 INFO L350 Elim1Store]: Elim1 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 15 [2023-02-18 05:39:00,953 INFO L350 Elim1Store]: Elim1 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 [2023-02-18 05:39:00,966 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 05:39:00,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 05:39:01,305 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 24 [2023-02-18 05:39:01,314 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 28 [2023-02-18 05:39:01,320 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 62 [2023-02-18 05:39:01,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2023-02-18 05:39:04,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:39:04,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 33 select indices, 33 select index equivalence classes, 0 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 528 case distinctions, treesize of input 2265 treesize of output 6337 [2023-02-18 05:39:04,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 05:39:04,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 59 select indices, 59 select index equivalence classes, 0 disjoint index pairs (out of 1711 index pairs), introduced 59 new quantified variables, introduced 1711 case distinctions, treesize of input 2113 treesize of output 15683