./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e 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/array-memsafety/array02-alloca-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 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:09:40,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:09:40,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:09:41,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:09:41,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:09:41,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:09:41,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:09:41,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:09:41,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:09:41,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:09:41,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:09:41,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:09:41,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:09:41,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:09:41,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:09:41,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:09:41,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:09:41,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:09:41,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:09:41,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:09:41,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:09:41,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:09:41,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:09:41,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:09:41,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:09:41,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:09:41,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:09:41,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:09:41,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:09:41,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:09:41,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:09:41,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:09:41,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:09:41,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:09:41,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:09:41,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:09:41,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:09:41,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:09:41,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:09:41,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:09:41,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:09:41,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:09:41,087 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:09:41,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:09:41,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:09:41,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:09:41,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:09:41,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:09:41,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:09:41,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:09:41,090 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:09:41,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:09:41,090 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:09:41,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:09:41,092 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:09:41,092 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:09:41,092 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:09:41,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:09:41,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:09:41,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:09:41,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:09:41,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:09:41,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:09:41,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:09:41,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:09:41,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:09:41,094 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:09:41,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:09:41,094 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:09:41,094 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 -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 [2023-02-17 08:09:41,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:09:41,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:09:41,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:09:41,316 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:09:41,317 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:09:41,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-17 08:09:42,380 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:09:42,549 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:09:42,549 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-17 08:09:42,557 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731621d24/e3c233bf74084ed0b2b005cba1e7dcfc/FLAG9b88e0659 [2023-02-17 08:09:42,566 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731621d24/e3c233bf74084ed0b2b005cba1e7dcfc [2023-02-17 08:09:42,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:09:42,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:09:42,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:42,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:09:42,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:09:42,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:42" (1/1) ... [2023-02-17 08:09:42,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700c621c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:42, skipping insertion in model container [2023-02-17 08:09:42,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:42" (1/1) ... [2023-02-17 08:09:42,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:09:42,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:09:42,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:42,812 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-17 08:09:42,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@15570d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:42, skipping insertion in model container [2023-02-17 08:09:42,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:42,813 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 08:09:42,814 INFO L158 Benchmark]: Toolchain (without parser) took 244.55ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 110.8MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:09:42,815 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:09:42,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.90ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 110.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 08:09:42,816 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.90ms. Allocated memory is still 178.3MB. Free memory was 122.4MB in the beginning and 110.8MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 533]: 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/array-memsafety/array02-alloca-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 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:09:44,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:09:44,855 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:09:44,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:09:44,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:09:44,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:09:44,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:09:44,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:09:44,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:09:44,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:09:44,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:09:44,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:09:44,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:09:44,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:09:44,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:09:44,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:09:44,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:09:44,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:09:44,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:09:44,945 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:09:44,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:09:44,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:09:44,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:09:44,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:09:44,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:09:44,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:09:44,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:09:44,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:09:44,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:09:44,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:09:44,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:09:44,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:09:44,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:09:44,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:09:44,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:09:44,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:09:44,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:09:44,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:09:44,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:09:44,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:09:44,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:09:44,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 08:09:45,015 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:09:45,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:09:45,016 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:09:45,016 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:09:45,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:09:45,017 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:09:45,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:09:45,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:09:45,018 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:09:45,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:09:45,019 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:09:45,019 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:09:45,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:09:45,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:09:45,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:09:45,019 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:09:45,020 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:09:45,020 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:09:45,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:09:45,020 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:09:45,020 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:09:45,020 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:09:45,020 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:09:45,021 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:09:45,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:09:45,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:09:45,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:09:45,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:09:45,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:09:45,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:09:45,022 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:09:45,022 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:09:45,022 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:09:45,022 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:09:45,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:09:45,023 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:09:45,023 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:09:45,023 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 -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 [2023-02-17 08:09:45,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:09:45,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:09:45,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:09:45,318 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:09:45,318 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:09:45,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-17 08:09:46,452 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:09:46,688 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:09:46,690 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-17 08:09:46,704 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b6d709ad/856b76fc33d740cdbcc001a66c79d628/FLAG17bc94752 [2023-02-17 08:09:46,719 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b6d709ad/856b76fc33d740cdbcc001a66c79d628 [2023-02-17 08:09:46,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:09:46,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:09:46,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:46,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:09:46,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:09:46,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:46" (1/1) ... [2023-02-17 08:09:46,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db51a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:46, skipping insertion in model container [2023-02-17 08:09:46,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:46" (1/1) ... [2023-02-17 08:09:46,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:09:46,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:09:46,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:46,999 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 08:09:47,008 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:09:47,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:47,038 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:09:47,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:47,085 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:09:47,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47 WrapperNode [2023-02-17 08:09:47,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:47,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:09:47,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:09:47,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:09:47,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,137 INFO L138 Inliner]: procedures = 117, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2023-02-17 08:09:47,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:09:47,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:09:47,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:09:47,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:09:47,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,173 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:09:47,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:09:47,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:09:47,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:09:47,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (1/1) ... [2023-02-17 08:09:47,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:09:47,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:09:47,220 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-17 08:09:47,226 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-17 08:09:47,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 08:09:47,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 08:09:47,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:09:47,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 08:09:47,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:09:47,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:09:47,391 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:09:47,392 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:09:47,549 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:09:47,553 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:09:47,553 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-17 08:09:47,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:09:47 BoogieIcfgContainer [2023-02-17 08:09:47,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:09:47,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:09:47,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:09:47,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:09:47,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:09:46" (1/3) ... [2023-02-17 08:09:47,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ae3175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:09:47, skipping insertion in model container [2023-02-17 08:09:47,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:47" (2/3) ... [2023-02-17 08:09:47,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63ae3175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:09:47, skipping insertion in model container [2023-02-17 08:09:47,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:09:47" (3/3) ... [2023-02-17 08:09:47,560 INFO L112 eAbstractionObserver]: Analyzing ICFG array02-alloca-2.i [2023-02-17 08:09:47,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:09:47,572 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2023-02-17 08:09:47,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:09:47,610 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;@456a7683, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:09:47,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-02-17 08:09:47,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:09:47,618 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:47,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:09:47,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2023-02-17 08:09:47,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:47,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028511012] [2023-02-17 08:09:47,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:47,632 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-17 08:09:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:47,639 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-17 08:09:47,685 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-17 08:09:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:47,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:09:47,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:47,804 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-17 08:09:47,811 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-17 08:09:47,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:47,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:47,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028511012] [2023-02-17 08:09:47,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028511012] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:47,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:47,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:09:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477990792] [2023-02-17 08:09:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:47,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:09:47,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:09:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:09:47,843 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:47,934 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-02-17 08:09:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:09:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 08:09:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:47,940 INFO L225 Difference]: With dead ends: 41 [2023-02-17 08:09:47,941 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 08:09:47,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:09:47,944 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:47,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 32 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 08:09:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-17 08:09:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 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-17 08:09:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-02-17 08:09:47,968 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 6 [2023-02-17 08:09:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:47,969 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-02-17 08:09:47,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-02-17 08:09:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:09:47,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:47,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:09:47,976 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 (2)] Ended with exit code 0 [2023-02-17 08:09:48,176 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-17 08:09:48,176 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:48,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:48,177 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2023-02-17 08:09:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:48,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238180228] [2023-02-17 08:09:48,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:48,179 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-17 08:09:48,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:48,194 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-17 08:09:48,232 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-17 08:09:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:48,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:09:48,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:48,309 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 8 treesize of output 7 [2023-02-17 08:09:48,317 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-17 08:09:48,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:48,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:48,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238180228] [2023-02-17 08:09:48,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238180228] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:48,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:48,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:09:48,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058309996] [2023-02-17 08:09:48,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:48,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:09:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:48,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:09:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:09:48,324 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:48,505 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-02-17 08:09:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:09:48,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 08:09:48,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:48,507 INFO L225 Difference]: With dead ends: 79 [2023-02-17 08:09:48,507 INFO L226 Difference]: Without dead ends: 79 [2023-02-17 08:09:48,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-17 08:09:48,508 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:48,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 150 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:09:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-17 08:09:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 42. [2023-02-17 08:09:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 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-17 08:09:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-02-17 08:09:48,513 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 6 [2023-02-17 08:09:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:48,514 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-02-17 08:09:48,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-02-17 08:09:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:09:48,514 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:48,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:09:48,524 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-17 08:09:48,721 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-17 08:09:48,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2023-02-17 08:09:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:48,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144900240] [2023-02-17 08:09:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:48,722 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-17 08:09:48,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:48,724 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-17 08:09:48,726 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-17 08:09:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:48,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:09:48,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:48,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 8 treesize of output 7 [2023-02-17 08:09:48,774 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-17 08:09:48,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:48,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:48,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144900240] [2023-02-17 08:09:48,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144900240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:48,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:48,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:09:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991701528] [2023-02-17 08:09:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:48,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:09:48,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:09:48,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:09:48,777 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:48,872 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2023-02-17 08:09:48,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:09:48,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 08:09:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:48,873 INFO L225 Difference]: With dead ends: 46 [2023-02-17 08:09:48,874 INFO L226 Difference]: Without dead ends: 46 [2023-02-17 08:09:48,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-17 08:09:48,875 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:48,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 61 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:48,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-17 08:09:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-02-17 08:09:48,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 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-17 08:09:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-02-17 08:09:48,878 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 6 [2023-02-17 08:09:48,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:48,878 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-02-17 08:09:48,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:48,878 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-02-17 08:09:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:09:48,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:48,878 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:48,892 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-17 08:09:49,085 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-17 08:09:49,086 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2023-02-17 08:09:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:49,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271443566] [2023-02-17 08:09:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:49,089 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-17 08:09:49,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:49,094 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-17 08:09:49,095 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-17 08:09:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:49,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:09:49,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:49,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:49,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:49,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271443566] [2023-02-17 08:09:49,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271443566] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:49,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:49,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-17 08:09:49,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116794751] [2023-02-17 08:09:49,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:49,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:09:49,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:09:49,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:09:49,183 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:49,244 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-02-17 08:09:49,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:09:49,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 08:09:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:49,247 INFO L225 Difference]: With dead ends: 77 [2023-02-17 08:09:49,247 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 08:09:49,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:09:49,248 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 164 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:49,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 177 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 08:09:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2023-02-17 08:09:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 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-17 08:09:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-02-17 08:09:49,251 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 10 [2023-02-17 08:09:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:49,251 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-02-17 08:09:49,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-02-17 08:09:49,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:09:49,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:49,252 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:49,260 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 (5)] Ended with exit code 0 [2023-02-17 08:09:49,459 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-17 08:09:49,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:49,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2023-02-17 08:09:49,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:49,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180704500] [2023-02-17 08:09:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:49,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-17 08:09:49,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:49,465 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-17 08:09:49,467 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-17 08:09:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:49,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 08:09:49,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:49,533 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 8 treesize of output 7 [2023-02-17 08:09:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:49,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:49,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:49,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180704500] [2023-02-17 08:09:49,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180704500] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:49,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:49,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-17 08:09:49,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056032818] [2023-02-17 08:09:49,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:49,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:09:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:09:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:09:49,650 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:50,191 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2023-02-17 08:09:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:09:50,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-17 08:09:50,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:50,193 INFO L225 Difference]: With dead ends: 119 [2023-02-17 08:09:50,193 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 08:09:50,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-02-17 08:09:50,194 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 322 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:50,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 116 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:09:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 08:09:50,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 59. [2023-02-17 08:09:50,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 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-17 08:09:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-17 08:09:50,198 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 10 [2023-02-17 08:09:50,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:50,198 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-17 08:09:50,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-17 08:09:50,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:09:50,198 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:50,199 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:50,219 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-17 08:09:50,410 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-17 08:09:50,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:50,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash -680998148, now seen corresponding path program 1 times [2023-02-17 08:09:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944342662] [2023-02-17 08:09:50,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:50,412 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-17 08:09:50,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:50,413 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-17 08:09:50,415 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-17 08:09:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:50,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:09:50,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:50,457 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-17 08:09:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:09:50,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:50,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:50,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944342662] [2023-02-17 08:09:50,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944342662] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:50,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:50,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:09:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995341461] [2023-02-17 08:09:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:50,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:09:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:50,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:09:50,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:09:50,469 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:50,537 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-02-17 08:09:50,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:09:50,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 08:09:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:50,539 INFO L225 Difference]: With dead ends: 53 [2023-02-17 08:09:50,539 INFO L226 Difference]: Without dead ends: 53 [2023-02-17 08:09:50,539 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-17 08:09:50,540 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:50,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-17 08:09:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-17 08:09:50,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-02-17 08:09:50,543 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 12 [2023-02-17 08:09:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:50,543 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-02-17 08:09:50,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-02-17 08:09:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:09:50,544 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:50,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:50,567 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-17 08:09:50,757 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-17 08:09:50,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash -680998147, now seen corresponding path program 1 times [2023-02-17 08:09:50,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:50,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095593201] [2023-02-17 08:09:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:50,758 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-17 08:09:50,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:50,759 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-17 08:09:50,762 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-17 08:09:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:50,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:09:50,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:50,826 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 8 treesize of output 7 [2023-02-17 08:09:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:09:50,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:50,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:50,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095593201] [2023-02-17 08:09:50,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095593201] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:50,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:50,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:09:50,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880086337] [2023-02-17 08:09:50,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:50,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:09:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:50,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:09:50,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:09:50,841 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:51,009 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2023-02-17 08:09:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:09:51,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 08:09:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:51,010 INFO L225 Difference]: With dead ends: 94 [2023-02-17 08:09:51,010 INFO L226 Difference]: Without dead ends: 94 [2023-02-17 08:09:51,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-17 08:09:51,011 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 113 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:51,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:09:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-17 08:09:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2023-02-17 08:09:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.305084745762712) internal successors, (77), 66 states have internal predecessors, (77), 0 states have call successors, (0), 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-17 08:09:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2023-02-17 08:09:51,015 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 12 [2023-02-17 08:09:51,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:51,016 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2023-02-17 08:09:51,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2023-02-17 08:09:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:09:51,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:51,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:51,049 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-17 08:09:51,223 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-17 08:09:51,223 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025157, now seen corresponding path program 1 times [2023-02-17 08:09:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250657034] [2023-02-17 08:09:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:51,224 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-17 08:09:51,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:51,225 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-17 08:09:51,229 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-17 08:09:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:51,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 08:09:51,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09: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 8 treesize of output 7 [2023-02-17 08:09:51,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:51,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:51,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250657034] [2023-02-17 08:09:51,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250657034] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 08:09:51,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 08:09:51,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-02-17 08:09:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102142058] [2023-02-17 08:09:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:51,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:09:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:09:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:09:51,410 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:51,550 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-02-17 08:09:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:09:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-17 08:09:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:51,552 INFO L225 Difference]: With dead ends: 67 [2023-02-17 08:09:51,552 INFO L226 Difference]: Without dead ends: 67 [2023-02-17 08:09:51,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:09:51,552 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:51,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:51,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-17 08:09:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2023-02-17 08:09:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-02-17 08:09:51,555 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 12 [2023-02-17 08:09:51,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:51,556 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-02-17 08:09:51,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-02-17 08:09:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:09:51,556 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:51,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:51,565 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-17 08:09:51,763 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-17 08:09:51,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:51,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:51,764 INFO L85 PathProgramCache]: Analyzing trace with hash 363893421, now seen corresponding path program 1 times [2023-02-17 08:09:51,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:51,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336963660] [2023-02-17 08:09:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:51,764 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-17 08:09:51,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:51,766 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-17 08:09:51,767 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-17 08:09:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:51,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 08:09:51,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:09:51,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:51,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:51,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336963660] [2023-02-17 08:09:51,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336963660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:51,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:51,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:09:51,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303899091] [2023-02-17 08:09:51,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:51,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:09:51,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:51,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:09:51,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:09:51,819 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:51,889 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2023-02-17 08:09:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:09:51,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 08:09:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:51,890 INFO L225 Difference]: With dead ends: 84 [2023-02-17 08:09:51,891 INFO L226 Difference]: Without dead ends: 84 [2023-02-17 08:09:51,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:09:51,891 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:51,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 76 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-17 08:09:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 52. [2023-02-17 08:09:51,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-02-17 08:09:51,894 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 13 [2023-02-17 08:09:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:51,894 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-02-17 08:09:51,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2023-02-17 08:09:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:09:51,895 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:51,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:51,921 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-17 08:09:52,101 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-17 08:09:52,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:52,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1064957999, now seen corresponding path program 1 times [2023-02-17 08:09:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:52,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828158639] [2023-02-17 08:09:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:52,103 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-17 08:09:52,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:52,107 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-17 08:09:52,108 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-17 08:09:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:52,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:09:52,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:52,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:52,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:52,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828158639] [2023-02-17 08:09:52,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828158639] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:52,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:52,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-17 08:09:52,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327510613] [2023-02-17 08:09:52,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:52,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 08:09:52,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:52,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 08:09:52,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:09:52,226 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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-17 08:09:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:52,402 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-02-17 08:09:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:09:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 08:09:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:52,404 INFO L225 Difference]: With dead ends: 86 [2023-02-17 08:09:52,404 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 08:09:52,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2023-02-17 08:09:52,404 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 185 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:52,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 84 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 08:09:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2023-02-17 08:09:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 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-17 08:09:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-02-17 08:09:52,407 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2023-02-17 08:09:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:52,407 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-02-17 08:09:52,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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-17 08:09:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-02-17 08:09:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:09:52,408 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:52,408 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:52,429 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 (11)] Forceful destruction successful, exit code 0 [2023-02-17 08:09:52,630 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-17 08:09:52,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2110205631, now seen corresponding path program 1 times [2023-02-17 08:09:52,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:52,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224090262] [2023-02-17 08:09:52,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:52,631 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-17 08:09:52,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:52,633 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-17 08:09:52,634 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-17 08:09:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:52,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:09:52,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:09:52,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:09:52,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:52,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224090262] [2023-02-17 08:09:52,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224090262] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:52,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:52,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-17 08:09:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992979448] [2023-02-17 08:09:52,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:52,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:09:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:09:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:09:52,720 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:52,795 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-02-17 08:09:52,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:09:52,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 08:09:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:52,796 INFO L225 Difference]: With dead ends: 69 [2023-02-17 08:09:52,796 INFO L226 Difference]: Without dead ends: 69 [2023-02-17 08:09:52,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:09:52,797 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:52,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 82 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-17 08:09:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-02-17 08:09:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 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-17 08:09:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2023-02-17 08:09:52,800 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 18 [2023-02-17 08:09:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:52,800 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2023-02-17 08:09:52,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2023-02-17 08:09:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:09:52,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:52,801 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:52,819 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 (12)] Ended with exit code 0 [2023-02-17 08:09:53,008 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-17 08:09:53,008 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:53,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:53,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1163693311, now seen corresponding path program 1 times [2023-02-17 08:09:53,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:53,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584081525] [2023-02-17 08:09:53,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:53,009 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-17 08:09:53,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:53,010 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-17 08:09:53,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 (13)] Waiting until timeout for monitored process [2023-02-17 08:09:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:53,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:09:53,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:53,060 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 8 treesize of output 7 [2023-02-17 08:09:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:09:53,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:53,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:09:53,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:53,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584081525] [2023-02-17 08:09:53,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584081525] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:53,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:53,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-17 08:09:53,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764767771] [2023-02-17 08:09:53,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:53,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:09:53,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:09:53,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:09:53,376 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:53,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:53,841 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2023-02-17 08:09:53,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:09:53,843 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-17 08:09:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:53,843 INFO L225 Difference]: With dead ends: 117 [2023-02-17 08:09:53,843 INFO L226 Difference]: Without dead ends: 117 [2023-02-17 08:09:53,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2023-02-17 08:09:53,844 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 367 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:53,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 92 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:09:53,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-17 08:09:53,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-02-17 08:09:53,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 0 states have call successors, (0), 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-17 08:09:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2023-02-17 08:09:53,850 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 18 [2023-02-17 08:09:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:53,851 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2023-02-17 08:09:53,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2023-02-17 08:09:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 08:09:53,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:53,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:53,864 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 (13)] Ended with exit code 0 [2023-02-17 08:09:54,062 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-17 08:09:54,063 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash -991865623, now seen corresponding path program 1 times [2023-02-17 08:09:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:54,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276249889] [2023-02-17 08:09:54,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:54,063 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-17 08:09:54,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:54,065 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-17 08:09:54,065 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-17 08:09:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:54,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:09:54,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:54,140 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc12#1.base_11| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc12#1.base_11|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc12#1.base_11| (_ bv0 1))))) is different from true [2023-02-17 08:09:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:09:54,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:54,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:54,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276249889] [2023-02-17 08:09:54,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276249889] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:54,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:54,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:09:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109558051] [2023-02-17 08:09:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:54,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:09:54,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:54,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:09:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-17 08:09:54,143 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-17 08:09:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:54,229 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2023-02-17 08:09:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:09:54,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-02-17 08:09:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:54,230 INFO L225 Difference]: With dead ends: 107 [2023-02-17 08:09:54,230 INFO L226 Difference]: Without dead ends: 83 [2023-02-17 08:09:54,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-17 08:09:54,231 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:54,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2023-02-17 08:09:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-17 08:09:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-17 08:09:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 82 states have internal predecessors, (95), 0 states have call successors, (0), 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-17 08:09:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-02-17 08:09:54,233 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 19 [2023-02-17 08:09:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:54,233 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-02-17 08:09:54,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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-17 08:09:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-02-17 08:09:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:09:54,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:54,234 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-17 08:09:54,252 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-17 08:09:54,440 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-17 08:09:54,441 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 302966996, now seen corresponding path program 2 times [2023-02-17 08:09:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:54,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56363524] [2023-02-17 08:09:54,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:09:54,442 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-17 08:09:54,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:54,443 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-17 08:09:54,445 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-17 08:09:54,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:09:54,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:09:54,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:09:54,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:54,553 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 8 treesize of output 7 [2023-02-17 08:09:54,692 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:54,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:55,399 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:55,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:55,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56363524] [2023-02-17 08:09:55,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56363524] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:55,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:55,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-17 08:09:55,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372874189] [2023-02-17 08:09:55,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:55,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 08:09:55,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:55,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 08:09:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:09:55,403 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:58,039 INFO L93 Difference]: Finished difference Result 587 states and 669 transitions. [2023-02-17 08:09:58,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 08:09:58,040 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-17 08:09:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:58,042 INFO L225 Difference]: With dead ends: 587 [2023-02-17 08:09:58,042 INFO L226 Difference]: Without dead ends: 587 [2023-02-17 08:09:58,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2023-02-17 08:09:58,043 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 792 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:58,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 299 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-17 08:09:58,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-02-17 08:09:58,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 107. [2023-02-17 08:09:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 106 states have internal predecessors, (125), 0 states have call successors, (0), 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-17 08:09:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2023-02-17 08:09:58,057 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 22 [2023-02-17 08:09:58,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:58,057 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2023-02-17 08:09:58,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:09:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2023-02-17 08:09:58,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 08:09:58,060 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:58,060 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:58,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 (15)] Forceful destruction successful, exit code 0 [2023-02-17 08:09:58,275 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-17 08:09:58,276 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:09:58,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1408555595, now seen corresponding path program 2 times [2023-02-17 08:09:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:58,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585279981] [2023-02-17 08:09:58,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:09:58,286 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-17 08:09:58,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:58,287 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-17 08:09:58,291 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-17 08:09:58,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:09:58,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:09:58,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:09:58,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:58,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 8 treesize of output 7 [2023-02-17 08:09:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:58,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:09:59,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:59,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585279981] [2023-02-17 08:09:59,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585279981] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:59,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:59,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-17 08:09:59,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436770218] [2023-02-17 08:09:59,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:59,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 08:09:59,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:59,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 08:09:59,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-17 08:09:59,304 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 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-17 08:10:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:02,066 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2023-02-17 08:10:02,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-17 08:10:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-17 08:10:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:02,068 INFO L225 Difference]: With dead ends: 207 [2023-02-17 08:10:02,068 INFO L226 Difference]: Without dead ends: 190 [2023-02-17 08:10:02,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 08:10:02,069 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 489 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:02,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 290 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-17 08:10:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-17 08:10:02,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 122. [2023-02-17 08:10:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.175) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 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-17 08:10:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2023-02-17 08:10:02,072 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 36 [2023-02-17 08:10:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:02,072 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2023-02-17 08:10:02,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 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-17 08:10:02,072 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2023-02-17 08:10:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:10:02,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:02,073 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1] [2023-02-17 08:10:02,090 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-17 08:10:02,284 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-17 08:10:02,285 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:10:02,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1048882662, now seen corresponding path program 3 times [2023-02-17 08:10:02,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:02,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487432829] [2023-02-17 08:10:02,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 08:10:02,286 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-17 08:10:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:02,287 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-17 08:10:02,289 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-17 08:10:02,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-17 08:10:02,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:02,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:10:02,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:02,537 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 8 treesize of output 7 [2023-02-17 08:10:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:10:02,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:10:04,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:04,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487432829] [2023-02-17 08:10:04,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487432829] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:04,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:04,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-02-17 08:10:04,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546605743] [2023-02-17 08:10:04,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:04,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 08:10:04,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:04,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 08:10:04,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2023-02-17 08:10:04,192 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 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-17 08:10:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:14,370 INFO L93 Difference]: Finished difference Result 1323 states and 1508 transitions. [2023-02-17 08:10:14,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-17 08:10:14,372 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 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 46 [2023-02-17 08:10:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:14,375 INFO L225 Difference]: With dead ends: 1323 [2023-02-17 08:10:14,375 INFO L226 Difference]: Without dead ends: 1323 [2023-02-17 08:10:14,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1166, Invalid=2494, Unknown=0, NotChecked=0, Total=3660 [2023-02-17 08:10:14,376 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 3131 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3131 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:14,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3131 Valid, 1271 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-02-17 08:10:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2023-02-17 08:10:14,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 170. [2023-02-17 08:10:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.1964285714285714) internal successors, (201), 169 states have internal predecessors, (201), 0 states have call successors, (0), 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-17 08:10:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2023-02-17 08:10:14,401 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 46 [2023-02-17 08:10:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:14,413 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2023-02-17 08:10:14,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 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-17 08:10:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2023-02-17 08:10:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:10:14,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:14,420 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:14,428 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 (17)] Ended with exit code 0 [2023-02-17 08:10:14,628 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-17 08:10:14,629 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:10:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash 873306578, now seen corresponding path program 3 times [2023-02-17 08:10:14,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:14,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798428503] [2023-02-17 08:10:14,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 08:10:14,630 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-17 08:10:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:14,631 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-17 08:10:14,640 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-17 08:10:14,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-17 08:10:14,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:14,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 08:10:14,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:14,783 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 8 treesize of output 7 [2023-02-17 08:10:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-17 08:10:15,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-17 08:10:22,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:22,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798428503] [2023-02-17 08:10:22,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798428503] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:22,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:22,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-17 08:10:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906327360] [2023-02-17 08:10:22,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:22,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 08:10:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 08:10:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=544, Unknown=2, NotChecked=0, Total=650 [2023-02-17 08:10:22,648 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 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-17 08:10:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:25,809 INFO L93 Difference]: Finished difference Result 206 states and 240 transitions. [2023-02-17 08:10:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 08:10:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 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 46 [2023-02-17 08:10:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:25,812 INFO L225 Difference]: With dead ends: 206 [2023-02-17 08:10:25,812 INFO L226 Difference]: Without dead ends: 175 [2023-02-17 08:10:25,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=203, Invalid=851, Unknown=2, NotChecked=0, Total=1056 [2023-02-17 08:10:25,812 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 257 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:25,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 250 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-17 08:10:25,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-17 08:10:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2023-02-17 08:10:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 169 states have internal predecessors, (200), 0 states have call successors, (0), 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-17 08:10:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2023-02-17 08:10:25,815 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 46 [2023-02-17 08:10:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:25,815 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2023-02-17 08:10:25,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.88) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 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-17 08:10:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2023-02-17 08:10:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 08:10:25,817 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:25,817 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:25,826 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-17 08:10:26,027 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-17 08:10:26,028 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:10:26,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash 82156500, now seen corresponding path program 4 times [2023-02-17 08:10:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:26,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102591836] [2023-02-17 08:10:26,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 08:10:26,029 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-17 08:10:26,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:26,045 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-17 08:10:26,048 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-17 08:10:26,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 08:10:26,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:26,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:10:26,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:26,126 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 8 treesize of output 7 [2023-02-17 08:10:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 08:10:26,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-17 08:10:27,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:27,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102591836] [2023-02-17 08:10:27,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102591836] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:27,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:27,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-02-17 08:10:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997377447] [2023-02-17 08:10:27,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:27,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 08:10:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 08:10:27,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-02-17 08:10:27,172 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 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-17 08:10:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:30,127 INFO L93 Difference]: Finished difference Result 303 states and 351 transitions. [2023-02-17 08:10:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-17 08:10:30,129 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 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 48 [2023-02-17 08:10:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:30,130 INFO L225 Difference]: With dead ends: 303 [2023-02-17 08:10:30,130 INFO L226 Difference]: Without dead ends: 303 [2023-02-17 08:10:30,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 08:10:30,131 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 1098 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:30,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 348 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-17 08:10:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-02-17 08:10:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 239. [2023-02-17 08:10:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 237 states have (on average 1.1772151898734178) internal successors, (279), 238 states have internal predecessors, (279), 0 states have call successors, (0), 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-17 08:10:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 279 transitions. [2023-02-17 08:10:30,134 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 279 transitions. Word has length 48 [2023-02-17 08:10:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:30,134 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 279 transitions. [2023-02-17 08:10:30,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 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-17 08:10:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 279 transitions. [2023-02-17 08:10:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-17 08:10:30,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:30,135 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:30,142 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 (19)] Ended with exit code 0 [2023-02-17 08:10:30,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-17 08:10:30,340 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:10:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1193800553, now seen corresponding path program 5 times [2023-02-17 08:10:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:30,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158211095] [2023-02-17 08:10:30,340 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 08:10:30,341 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-17 08:10:30,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:30,342 INFO L229 MonitoredProcess]: Starting monitored process 20 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-17 08:10:30,344 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 (20)] Waiting until timeout for monitored process [2023-02-17 08:10:30,529 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-02-17 08:10:30,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:30,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 08:10:30,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:30,553 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 8 treesize of output 7 [2023-02-17 08:10:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 132 proven. 155 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 08:10:31,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:10:35,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158211095] [2023-02-17 08:10:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158211095] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:35,384 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:35,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2023-02-17 08:10:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674822642] [2023-02-17 08:10:35,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:35,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-17 08:10:35,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:35,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-17 08:10:35,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 08:10:35,386 INFO L87 Difference]: Start difference. First operand 239 states and 279 transitions. Second operand has 35 states, 35 states have (on average 4.2) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 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-17 08:10:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:50,987 INFO L93 Difference]: Finished difference Result 465 states and 532 transitions. [2023-02-17 08:10:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-17 08:10:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.2) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 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 80 [2023-02-17 08:10:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:50,990 INFO L225 Difference]: With dead ends: 465 [2023-02-17 08:10:50,990 INFO L226 Difference]: Without dead ends: 418 [2023-02-17 08:10:50,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=858, Invalid=4112, Unknown=0, NotChecked=0, Total=4970 [2023-02-17 08:10:50,991 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 853 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:50,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 1277 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-02-17 08:10:50,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-17 08:10:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 254. [2023-02-17 08:10:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 1.1706349206349207) internal successors, (295), 253 states have internal predecessors, (295), 0 states have call successors, (0), 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-17 08:10:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 295 transitions. [2023-02-17 08:10:50,995 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 295 transitions. Word has length 80 [2023-02-17 08:10:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:50,995 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 295 transitions. [2023-02-17 08:10:50,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.2) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 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-17 08:10:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 295 transitions. [2023-02-17 08:10:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-17 08:10:50,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:50,996 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:51,004 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 (20)] Forceful destruction successful, exit code 0 [2023-02-17 08:10:51,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-17 08:10:51,198 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:10:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 625249264, now seen corresponding path program 6 times [2023-02-17 08:10:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:51,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147293068] [2023-02-17 08:10:51,200 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 08:10:51,200 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-17 08:10:51,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:51,201 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-17 08:10:51,203 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-17 08:10:51,501 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-02-17 08:10:51,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:51,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 08:10:51,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:51,523 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 8 treesize of output 7 [2023-02-17 08:10:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 260 proven. 28 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-02-17 08:10:52,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 228 proven. 60 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-02-17 08:10:56,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:56,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147293068] [2023-02-17 08:10:56,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147293068] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:56,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:56,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2023-02-17 08:10:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928325914] [2023-02-17 08:10:56,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:56,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 08:10:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:56,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 08:10:56,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 08:10:56,897 INFO L87 Difference]: Start difference. First operand 254 states and 295 transitions. Second operand has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:01,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:01,215 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2023-02-17 08:11:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 08:11:01,215 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-02-17 08:11:01,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:01,216 INFO L225 Difference]: With dead ends: 316 [2023-02-17 08:11:01,216 INFO L226 Difference]: Without dead ends: 254 [2023-02-17 08:11:01,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=459, Invalid=1703, Unknown=0, NotChecked=0, Total=2162 [2023-02-17 08:11:01,216 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 244 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:01,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 492 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-02-17 08:11:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-17 08:11:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2023-02-17 08:11:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 1.1666666666666667) internal successors, (294), 253 states have internal predecessors, (294), 0 states have call successors, (0), 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-17 08:11:01,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2023-02-17 08:11:01,220 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 90 [2023-02-17 08:11:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:01,220 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2023-02-17 08:11:01,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2023-02-17 08:11:01,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-02-17 08:11:01,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:01,220 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1] [2023-02-17 08:11:01,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 (21)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:01,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-17 08:11:01,432 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:11:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:01,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2084926986, now seen corresponding path program 4 times [2023-02-17 08:11:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:01,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742365778] [2023-02-17 08:11:01,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 08:11:01,433 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-17 08:11:01,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:01,434 INFO L229 MonitoredProcess]: Starting monitored process 22 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-17 08:11:01,436 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 (22)] Waiting until timeout for monitored process [2023-02-17 08:11:01,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 08:11:01,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:11:01,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 08:11:01,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:01,582 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 8 treesize of output 7 [2023-02-17 08:11:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:11:03,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:11:12,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:12,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742365778] [2023-02-17 08:11:12,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742365778] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:12,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:12,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2023-02-17 08:11:12,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286405851] [2023-02-17 08:11:12,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:12,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-17 08:11:12,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-17 08:11:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=2451, Unknown=0, NotChecked=0, Total=3306 [2023-02-17 08:11:12,243 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand has 58 states, 57 states have (on average 3.263157894736842) internal successors, (186), 58 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:29,295 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 [] [2023-02-17 08:11:30,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:11:32,735 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 [] [2023-02-17 08:11:38,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:11:40,250 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 [] [2023-02-17 08:11:46,453 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 [] [2023-02-17 08:11:48,456 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 [] [2023-02-17 08:11:54,575 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 [] [2023-02-17 08:11:56,579 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 [] [2023-02-17 08:12:02,339 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 [] [2023-02-17 08:12:04,342 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 [] [2023-02-17 08:12:09,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:12:11,693 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 [] [2023-02-17 08:12:17,364 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 [] [2023-02-17 08:12:19,369 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 [] [2023-02-17 08:12:24,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:12:26,853 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 [] [2023-02-17 08:12:31,787 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 [] [2023-02-17 08:12:33,791 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 [] [2023-02-17 08:12:39,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:12:41,420 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 [] [2023-02-17 08:12:46,484 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 [] [2023-02-17 08:12:48,487 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 [] [2023-02-17 08:12:53,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:12:55,224 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 [] [2023-02-17 08:12:59,819 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 [] [2023-02-17 08:13:01,822 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 [] [2023-02-17 08:13:06,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:08,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 [] [2023-02-17 08:13:13,290 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 [] [2023-02-17 08:13:15,293 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 [] [2023-02-17 08:13:19,975 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 [] [2023-02-17 08:13:24,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:29,285 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 [] [2023-02-17 08:13:33,036 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 [] [2023-02-17 08:13:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:13:40,510 INFO L93 Difference]: Finished difference Result 6137 states and 7005 transitions. [2023-02-17 08:13:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-02-17 08:13:40,512 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.263157894736842) internal successors, (186), 58 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2023-02-17 08:13:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:13:40,524 INFO L225 Difference]: With dead ends: 6137 [2023-02-17 08:13:40,525 INFO L226 Difference]: Without dead ends: 6137 [2023-02-17 08:13:40,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3996 ImplicationChecksByTransitivity, 65.4s TimeCoverageRelationStatistics Valid=4630, Invalid=10376, Unknown=0, NotChecked=0, Total=15006 [2023-02-17 08:13:40,528 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 11900 mSDsluCounter, 5197 mSDsCounter, 0 mSdLazyCounter, 6226 mSolverCounterSat, 65 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11900 SdHoareTripleChecker+Valid, 5404 SdHoareTripleChecker+Invalid, 6325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 6226 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 92.9s IncrementalHoareTripleChecker+Time [2023-02-17 08:13:40,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11900 Valid, 5404 Invalid, 6325 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 6226 Invalid, 34 Unknown, 0 Unchecked, 92.9s Time] [2023-02-17 08:13:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6137 states. [2023-02-17 08:13:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6137 to 350. [2023-02-17 08:13:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 348 states have (on average 1.1896551724137931) internal successors, (414), 349 states have internal predecessors, (414), 0 states have call successors, (0), 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-17 08:13:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 414 transitions. [2023-02-17 08:13:40,556 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 414 transitions. Word has length 94 [2023-02-17 08:13:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:13:40,557 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 414 transitions. [2023-02-17 08:13:40,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.263157894736842) internal successors, (186), 58 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:13:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 414 transitions. [2023-02-17 08:13:40,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-02-17 08:13:40,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:13:40,558 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:13:40,579 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 (22)] Forceful destruction successful, exit code 0 [2023-02-17 08:13:40,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-17 08:13:40,769 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:13:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:13:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash -132332109, now seen corresponding path program 7 times [2023-02-17 08:13:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:13:40,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292836508] [2023-02-17 08:13:40,770 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 08:13:40,771 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-17 08:13:40,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:13:40,772 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-17 08:13:40,774 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-17 08:13:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:13:40,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 08:13:40,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:13:40,897 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 8 treesize of output 7 [2023-02-17 08:13:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 176 proven. 185 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 08:13:41,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:13:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 0 proven. 397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:13:45,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:13:45,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292836508] [2023-02-17 08:13:45,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292836508] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:13:45,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:13:45,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 39 [2023-02-17 08:13:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791922870] [2023-02-17 08:13:45,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:13:45,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-17 08:13:45,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:13:45,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-17 08:13:45,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2023-02-17 08:13:45,804 INFO L87 Difference]: Start difference. First operand 350 states and 414 transitions. Second operand has 39 states, 39 states have (on average 4.333333333333333) internal successors, (169), 39 states have internal predecessors, (169), 0 states have call successors, (0), 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-17 08:14:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:14:03,758 INFO L93 Difference]: Finished difference Result 606 states and 701 transitions. [2023-02-17 08:14:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-17 08:14:03,760 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 4.333333333333333) internal successors, (169), 39 states have internal predecessors, (169), 0 states have call successors, (0), 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 94 [2023-02-17 08:14:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:14:03,761 INFO L225 Difference]: With dead ends: 606 [2023-02-17 08:14:03,761 INFO L226 Difference]: Without dead ends: 529 [2023-02-17 08:14:03,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=965, Invalid=4887, Unknown=0, NotChecked=0, Total=5852 [2023-02-17 08:14:03,762 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 1541 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-02-17 08:14:03,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 1792 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-02-17 08:14:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2023-02-17 08:14:03,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 364. [2023-02-17 08:14:03,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 362 states have (on average 1.1850828729281768) internal successors, (429), 363 states have internal predecessors, (429), 0 states have call successors, (0), 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-17 08:14:03,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 429 transitions. [2023-02-17 08:14:03,767 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 429 transitions. Word has length 94 [2023-02-17 08:14:03,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:14:03,767 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 429 transitions. [2023-02-17 08:14:03,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.333333333333333) internal successors, (169), 39 states have internal predecessors, (169), 0 states have call successors, (0), 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-17 08:14:03,767 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 429 transitions. [2023-02-17 08:14:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-02-17 08:14:03,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:14:03,767 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:14:03,783 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-17 08:14:03,968 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-17 08:14:03,968 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-17 08:14:03,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:14:03,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1612923912, now seen corresponding path program 8 times [2023-02-17 08:14:03,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:14:03,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649043916] [2023-02-17 08:14:03,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:14:03,969 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-17 08:14:03,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:14:03,970 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-17 08:14:03,973 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-17 08:14:04,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:14:04,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:14:04,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 08:14:04,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:14:04,110 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 8 treesize of output 7 [2023-02-17 08:14:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 56 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:05,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:14:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:14:12,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:14:12,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649043916] [2023-02-17 08:14:12,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649043916] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:14:12,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:14:12,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2023-02-17 08:14:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329273269] [2023-02-17 08:14:12,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:14:12,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-17 08:14:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:14:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-17 08:14:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1989, Unknown=0, NotChecked=0, Total=2256 [2023-02-17 08:14:12,593 INFO L87 Difference]: Start difference. First operand 364 states and 429 transitions. Second operand has 48 states, 48 states have (on average 4.125) internal successors, (198), 48 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)