./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.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/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:09:47,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:09:47,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:09:47,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:09:47,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:09:47,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:09:47,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:09:47,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:09:47,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:09:47,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:09:47,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:09:47,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:09:47,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:09:47,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:09:47,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:09:47,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:09:47,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:09:47,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:09:47,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:09:47,614 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:09:47,616 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:09:47,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:09:47,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:09:47,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:09:47,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:09:47,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:09:47,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:09:47,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:09:47,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:09:47,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:09:47,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:09:47,629 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:09:47,631 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:09:47,631 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:09:47,632 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:09:47,632 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:09:47,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:09:47,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:09:47,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:09:47,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:09:47,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:09:47,636 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:47,667 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:09:47,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:09:47,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:09:47,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:09:47,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:09:47,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:09:47,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:09:47,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:09:47,670 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:09:47,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:09:47,671 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:09:47,671 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:09:47,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:09:47,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:09:47,672 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:09:47,672 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:09:47,672 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:09:47,672 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:09:47,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:09:47,673 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:09:47,673 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:09:47,673 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:09:47,673 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:09:47,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:09:47,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:09:47,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:09:47,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:09:47,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:09:47,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:09:47,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:09:47,675 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:09:47,675 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:09:47,676 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:09:47,676 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:09:47,676 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2023-02-17 08:09:47,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:09:47,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:09:47,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:09:47,962 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:09:47,963 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:09:47,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-17 08:09:49,202 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:09:49,435 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:09:49,436 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-17 08:09:49,452 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f849f4838/26c93879078242bb8ac63ecc1195158d/FLAG1a31ca167 [2023-02-17 08:09:49,463 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f849f4838/26c93879078242bb8ac63ecc1195158d [2023-02-17 08:09:49,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:09:49,465 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:09:49,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:49,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:09:49,469 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:09:49,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:49" (1/1) ... [2023-02-17 08:09:49,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9796b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:49, skipping insertion in model container [2023-02-17 08:09:49,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:49" (1/1) ... [2023-02-17 08:09:49,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:09:49,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:09:49,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:49,771 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:49,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ddfb528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:49, skipping insertion in model container [2023-02-17 08:09:49,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:49,774 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 08:09:49,776 INFO L158 Benchmark]: Toolchain (without parser) took 309.21ms. Allocated memory is still 134.2MB. Free memory was 83.5MB in the beginning and 71.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:09:49,776 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 134.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:09:49,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.46ms. Allocated memory is still 134.2MB. Free memory was 83.1MB in the beginning and 71.8MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-17 08:09:49,778 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.19ms. Allocated memory is still 134.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.46ms. Allocated memory is still 134.2MB. Free memory was 83.1MB in the beginning and 71.8MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:09:51,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:09:51,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:09:51,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:09:51,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:09:51,740 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:09:51,742 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:09:51,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:09:51,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:09:51,753 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:09:51,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:09:51,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:09:51,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:09:51,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:09:51,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:09:51,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:09:51,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:09:51,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:09:51,767 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:09:51,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:09:51,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:09:51,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:09:51,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:09:51,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:09:51,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:09:51,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:09:51,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:09:51,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:09:51,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:09:51,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:09:51,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:09:51,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:09:51,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:09:51,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:09:51,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:09:51,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:09:51,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:09:51,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:09:51,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:09:51,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:09:51,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:09:51,797 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:51,815 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:09:51,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:09:51,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:09:51,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:09:51,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:09:51,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:09:51,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:09:51,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:09:51,818 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:09:51,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:09:51,819 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:09:51,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:09:51,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:09:51,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:09:51,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:09:51,820 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:09:51,820 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:09:51,820 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:09:51,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:09:51,820 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:09:51,821 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:09:51,821 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:09:51,821 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:09:51,821 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:09:51,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:09:51,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:09:51,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:09:51,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:09:51,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:09:51,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:09:51,823 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:09:51,823 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:09:51,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:09:51,823 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:09:51,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:09:51,824 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:09:51,824 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:09:51,824 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2023-02-17 08:09:52,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:09:52,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:09:52,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:09:52,191 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:09:52,192 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:09:52,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-17 08:09:53,303 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:09:53,591 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:09:53,595 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2023-02-17 08:09:53,613 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cad4a21c/0a60bdc87bad47919fdf00905500ada2/FLAGf99356c53 [2023-02-17 08:09:53,628 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cad4a21c/0a60bdc87bad47919fdf00905500ada2 [2023-02-17 08:09:53,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:09:53,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:09:53,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:53,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:09:53,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:09:53,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:53" (1/1) ... [2023-02-17 08:09:53,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b63a7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:53, skipping insertion in model container [2023-02-17 08:09:53,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:09:53" (1/1) ... [2023-02-17 08:09:53,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:09:53,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:09:54,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:54,016 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 08:09:54,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:09:54,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:54,079 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:09:54,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:09:54,150 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:09:54,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:54 WrapperNode [2023-02-17 08:09:54,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:09:54,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:09:54,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:09:54,152 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:09:54,159 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:54" (1/1) ... [2023-02-17 08:09:54,184 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:54" (1/1) ... [2023-02-17 08:09:54,204 INFO L138 Inliner]: procedures = 117, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-02-17 08:09:54,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:09:54,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:09:54,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:09:54,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:09:54,213 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:54" (1/1) ... [2023-02-17 08:09:54,214 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:54" (1/1) ... [2023-02-17 08:09:54,218 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:54" (1/1) ... [2023-02-17 08:09:54,218 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:54" (1/1) ... [2023-02-17 08:09:54,230 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:54" (1/1) ... [2023-02-17 08:09:54,234 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:54" (1/1) ... [2023-02-17 08:09:54,238 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:54" (1/1) ... [2023-02-17 08:09:54,240 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:54" (1/1) ... [2023-02-17 08:09:54,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:09:54,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:09:54,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:09:54,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:09:54,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:54" (1/1) ... [2023-02-17 08:09:54,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:09:54,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:09:54,302 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:54,326 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:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-17 08:09:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 08:09:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:09:54,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-17 08:09:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:09:54,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:09:54,504 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:09:54,506 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:09:55,005 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:09:55,010 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:09:55,010 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 08:09:55,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:09:55 BoogieIcfgContainer [2023-02-17 08:09:55,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:09:55,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:09:55,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:09:55,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:09:55,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:09:53" (1/3) ... [2023-02-17 08:09:55,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12008cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:09:55, skipping insertion in model container [2023-02-17 08:09:55,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:09:54" (2/3) ... [2023-02-17 08:09:55,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12008cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:09:55, skipping insertion in model container [2023-02-17 08:09:55,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:09:55" (3/3) ... [2023-02-17 08:09:55,021 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca-1.i [2023-02-17 08:09:55,037 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:09:55,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-02-17 08:09:55,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:09:55,092 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;@87c2fce, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:09:55,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-02-17 08:09:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 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:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:09:55,101 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:55,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:09:55,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:09:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2023-02-17 08:09:55,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:55,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854642091] [2023-02-17 08:09:55,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:55,123 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:55,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:55,126 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:55,128 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:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:55,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:09:55,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:55,236 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:55,241 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:55,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:55,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:55,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854642091] [2023-02-17 08:09:55,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854642091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:55,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:55,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:09:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582955537] [2023-02-17 08:09:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:55,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:09:55,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:55,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:09:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:09:55,274 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 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:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:55,415 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2023-02-17 08:09:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:09:55,418 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:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:55,424 INFO L225 Difference]: With dead ends: 66 [2023-02-17 08:09:55,424 INFO L226 Difference]: Without dead ends: 64 [2023-02-17 08:09:55,426 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:55,430 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:55,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-17 08:09:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-02-17 08:09:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 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:09:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2023-02-17 08:09:55,465 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 6 [2023-02-17 08:09:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:55,465 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2023-02-17 08:09:55,466 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:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2023-02-17 08:09:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:09:55,466 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:55,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:09:55,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 08:09:55,676 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:55,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:09:55,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:55,677 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2023-02-17 08:09:55,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:55,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120587851] [2023-02-17 08:09:55,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:55,679 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:55,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:55,681 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:55,684 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:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:55,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:09:55,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:55,755 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:55,765 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:55,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:55,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:55,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120587851] [2023-02-17 08:09:55,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120587851] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:55,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:55,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:09:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644405816] [2023-02-17 08:09:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:55,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:09:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:55,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:09:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:09:55,774 INFO L87 Difference]: Start difference. First operand 64 states and 72 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:56,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:56,116 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2023-02-17 08:09:56,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:09:56,118 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:56,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:56,119 INFO L225 Difference]: With dead ends: 129 [2023-02-17 08:09:56,119 INFO L226 Difference]: Without dead ends: 129 [2023-02-17 08:09:56,119 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:56,120 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 74 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:56,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 275 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:09:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-17 08:09:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 67. [2023-02-17 08:09:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 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:56,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2023-02-17 08:09:56,132 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 6 [2023-02-17 08:09:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:56,133 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2023-02-17 08:09:56,133 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:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2023-02-17 08:09:56,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 08:09:56,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:56,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 08:09:56,146 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:56,343 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:56,344 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:09:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2023-02-17 08:09:56,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:56,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909512791] [2023-02-17 08:09:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:56,345 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:56,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:56,347 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:56,350 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:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:56,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:09:56,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:56,413 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:56,431 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:56,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:56,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:56,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909512791] [2023-02-17 08:09:56,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909512791] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:56,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:56,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:09:56,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280967056] [2023-02-17 08:09:56,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:56,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:09:56,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:56,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:09:56,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:09:56,434 INFO L87 Difference]: Start difference. First operand 67 states and 75 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:56,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:56,646 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2023-02-17 08:09:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:09:56,647 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:56,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:56,648 INFO L225 Difference]: With dead ends: 71 [2023-02-17 08:09:56,648 INFO L226 Difference]: Without dead ends: 71 [2023-02-17 08:09:56,648 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:56,649 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 74 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:56,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 109 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:09:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-17 08:09:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2023-02-17 08:09:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 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:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2023-02-17 08:09:56,655 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 6 [2023-02-17 08:09:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:56,655 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2023-02-17 08:09:56,655 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:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2023-02-17 08:09:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:09:56,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:56,656 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:56,666 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:56,866 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:56,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:09:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:56,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2023-02-17 08:09:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:56,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780067676] [2023-02-17 08:09:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:56,868 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:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:56,870 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:56,871 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:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:56,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:09:56,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:56,960 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:56,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:56,997 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:56,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:56,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780067676] [2023-02-17 08:09:56,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780067676] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:56,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:56,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-17 08:09:56,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268320091] [2023-02-17 08:09:56,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:56,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:09:56,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:09:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:09:57,000 INFO L87 Difference]: Start difference. First operand 66 states and 74 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:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:57,080 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2023-02-17 08:09:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:09:57,082 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:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:57,083 INFO L225 Difference]: With dead ends: 127 [2023-02-17 08:09:57,083 INFO L226 Difference]: Without dead ends: 127 [2023-02-17 08:09:57,083 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:57,084 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 247 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:57,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 258 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-17 08:09:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 72. [2023-02-17 08:09:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 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:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2023-02-17 08:09:57,090 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 10 [2023-02-17 08:09:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:57,091 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2023-02-17 08:09:57,091 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:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2023-02-17 08:09:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 08:09:57,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:57,092 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:57,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:09:57,297 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:57,298 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:09:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2023-02-17 08:09:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:57,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468045508] [2023-02-17 08:09:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:57,299 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:57,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:57,300 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:57,303 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:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:57,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 08:09:57,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:57,363 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:57,406 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:57,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:09:57,560 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:57,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:57,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468045508] [2023-02-17 08:09:57,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468045508] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:09:57,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:09:57,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-17 08:09:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017882477] [2023-02-17 08:09:57,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:09:57,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:09:57,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:57,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:09:57,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:09:57,562 INFO L87 Difference]: Start difference. First operand 72 states and 80 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:58,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:58,867 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2023-02-17 08:09:58,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:09:58,869 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:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:58,870 INFO L225 Difference]: With dead ends: 140 [2023-02-17 08:09:58,870 INFO L226 Difference]: Without dead ends: 140 [2023-02-17 08:09:58,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-02-17 08:09:58,871 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 339 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:58,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 208 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-17 08:09:58,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-17 08:09:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 84. [2023-02-17 08:09:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 83 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:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2023-02-17 08:09:58,877 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 10 [2023-02-17 08:09:58,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:58,877 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-17 08:09:58,877 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:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2023-02-17 08:09:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:09:58,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:58,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:58,891 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:59,079 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:59,079 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:09:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -680998152, now seen corresponding path program 1 times [2023-02-17 08:09:59,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:59,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301142420] [2023-02-17 08:09:59,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:59,080 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:59,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:59,082 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:59,083 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:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:59,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:09:59,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:59,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:09:59,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 32 [2023-02-17 08:09:59,157 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:59,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:59,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:59,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301142420] [2023-02-17 08:09:59,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301142420] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:59,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:59,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:09:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512308535] [2023-02-17 08:09:59,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:59,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:09:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:09:59,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:09:59,160 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 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:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:59,266 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-02-17 08:09:59,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:09:59,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:59,268 INFO L225 Difference]: With dead ends: 77 [2023-02-17 08:09:59,268 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 08:09:59,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:59,269 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:59,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:09:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 08:09:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-17 08:09:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 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:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-02-17 08:09:59,276 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 12 [2023-02-17 08:09:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:59,277 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-02-17 08:09:59,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-02-17 08:09:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:09:59,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:59,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:59,292 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:59,487 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:59,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:09:59,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:09:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash -680998151, now seen corresponding path program 1 times [2023-02-17 08:09:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:09:59,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982555901] [2023-02-17 08:09:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:09:59,488 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:59,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:09:59,489 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:59,490 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:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:09:59,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:09:59,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:09:59,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:09:59,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-17 08:09:59,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:09:59,579 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:59,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:09:59,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:09:59,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982555901] [2023-02-17 08:09:59,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982555901] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:09:59,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:09:59,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:09:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005438293] [2023-02-17 08:09:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:09:59,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:09:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:09:59,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:09:59,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:09:59,585 INFO L87 Difference]: Start difference. First operand 77 states and 88 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:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:09:59,780 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2023-02-17 08:09:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:09:59,783 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:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:09:59,784 INFO L225 Difference]: With dead ends: 132 [2023-02-17 08:09:59,784 INFO L226 Difference]: Without dead ends: 132 [2023-02-17 08:09:59,784 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:59,785 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 67 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:09:59,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 139 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:09:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-17 08:09:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2023-02-17 08:09:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 79 states have internal predecessors, (92), 0 states have call successors, (0), 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:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2023-02-17 08:09:59,790 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 12 [2023-02-17 08:09:59,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:09:59,790 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2023-02-17 08:09:59,791 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:59,791 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2023-02-17 08:09:59,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-17 08:09:59,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:09:59,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:09:59,799 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:59,999 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:10:00,000 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:00,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025161, now seen corresponding path program 1 times [2023-02-17 08:10:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:00,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757759284] [2023-02-17 08:10:00,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:00,001 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:00,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:00,002 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:10:00,003 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:10:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:00,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:10:00,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:00,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:00,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-17 08:10:00,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:10:00,098 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:10:00,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:10:00,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:00,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757759284] [2023-02-17 08:10:00,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757759284] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:10:00,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:10:00,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:10:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971618507] [2023-02-17 08:10:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:10:00,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:10:00,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:10:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:10:00,101 INFO L87 Difference]: Start difference. First operand 80 states and 92 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:10:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:00,328 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-02-17 08:10:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:10:00,329 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:10:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:00,329 INFO L225 Difference]: With dead ends: 86 [2023-02-17 08:10:00,329 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 08:10:00,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:10:00,330 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:00,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 105 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:10:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 08:10:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2023-02-17 08:10:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 78 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:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-02-17 08:10:00,333 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 12 [2023-02-17 08:10:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:00,333 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-02-17 08:10:00,333 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:10:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-02-17 08:10:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:10:00,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:00,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:00,343 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 (9)] Forceful destruction successful, exit code 0 [2023-02-17 08:10:00,541 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:10:00,541 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash 363893777, now seen corresponding path program 1 times [2023-02-17 08:10:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:00,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739191857] [2023-02-17 08:10:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:00,542 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:00,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:00,545 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:10:00,545 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:10:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:00,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:10:00,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:00,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:00,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2023-02-17 08:10:00,626 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:10:00,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:10:00,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739191857] [2023-02-17 08:10:00,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739191857] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:10:00,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:10:00,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 08:10:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741237402] [2023-02-17 08:10:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:10:00,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:10:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:00,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:10:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:10:00,629 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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:10:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:00,688 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2023-02-17 08:10:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:10:00,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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:10:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:00,689 INFO L225 Difference]: With dead ends: 77 [2023-02-17 08:10:00,689 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 08:10:00,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:10:00,690 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:00,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:10:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 08:10:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-02-17 08:10:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 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:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2023-02-17 08:10:00,694 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 13 [2023-02-17 08:10:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:00,694 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2023-02-17 08:10:00,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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:10:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2023-02-17 08:10:00,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:10:00,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:00,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:00,704 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:10:00,904 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:10:00,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:00,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:00,905 INFO L85 PathProgramCache]: Analyzing trace with hash 363893778, now seen corresponding path program 1 times [2023-02-17 08:10:00,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:00,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894190334] [2023-02-17 08:10:00,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:00,905 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:00,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:00,907 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:10:00,909 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:10:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:00,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:10:00,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:00,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:00,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 29 [2023-02-17 08:10:00,984 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:10:00,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:10:00,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:00,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894190334] [2023-02-17 08:10:00,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894190334] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:10:00,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:10:00,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:10:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265732062] [2023-02-17 08:10:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:10:00,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:10:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:10:00,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:10:00,987 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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:10:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:01,148 INFO L93 Difference]: Finished difference Result 127 states and 144 transitions. [2023-02-17 08:10:01,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:10:01,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:10:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:01,149 INFO L225 Difference]: With dead ends: 127 [2023-02-17 08:10:01,150 INFO L226 Difference]: Without dead ends: 127 [2023-02-17 08:10:01,150 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:10:01,150 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 57 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:01,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 134 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:10:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-02-17 08:10:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 81. [2023-02-17 08:10:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.393939393939394) internal successors, (92), 80 states have internal predecessors, (92), 0 states have call successors, (0), 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:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 92 transitions. [2023-02-17 08:10:01,154 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 92 transitions. Word has length 13 [2023-02-17 08:10:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:01,154 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 92 transitions. [2023-02-17 08:10:01,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:10:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 92 transitions. [2023-02-17 08:10:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 08:10:01,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:01,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:01,164 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:10:01,364 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:10:01,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1064958356, now seen corresponding path program 1 times [2023-02-17 08:10:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:01,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909989866] [2023-02-17 08:10:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:01,365 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:01,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:01,367 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:10:01,367 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:10:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:01,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:10:01,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:01,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:01,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 29 [2023-02-17 08:10:01,473 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:10:01,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:10:01,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:01,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909989866] [2023-02-17 08:10:01,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909989866] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:10:01,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:10:01,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 08:10:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242478412] [2023-02-17 08:10:01,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:10:01,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:10:01,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:01,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:10:01,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:10:01,476 INFO L87 Difference]: Start difference. First operand 81 states and 92 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:01,687 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2023-02-17 08:10:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:10:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-17 08:10:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:01,689 INFO L225 Difference]: With dead ends: 83 [2023-02-17 08:10:01,689 INFO L226 Difference]: Without dead ends: 83 [2023-02-17 08:10:01,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-17 08:10:01,690 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:01,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:10:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-17 08:10:01,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-02-17 08:10:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2023-02-17 08:10:01,693 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 13 [2023-02-17 08:10:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:01,694 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2023-02-17 08:10:01,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2023-02-17 08:10:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:10:01,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:01,695 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:01,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 08:10:01,904 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:10:01,904 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:01,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 262068158, now seen corresponding path program 1 times [2023-02-17 08:10:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:01,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628608079] [2023-02-17 08:10:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:01,905 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:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:01,906 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:10:01,907 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:10:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:01,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:10:01,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:01,991 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:10:01,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:02,027 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:10:02,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:02,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628608079] [2023-02-17 08:10:02,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628608079] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:02,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:02,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-17 08:10:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716323925] [2023-02-17 08:10:02,027 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:02,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:10:02,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:02,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:10:02,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:10:02,028 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:02,240 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2023-02-17 08:10:02,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:10:02,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 08:10:02,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:02,241 INFO L225 Difference]: With dead ends: 100 [2023-02-17 08:10:02,242 INFO L226 Difference]: Without dead ends: 100 [2023-02-17 08:10:02,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 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:10:02,242 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 63 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:02,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 199 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:10:02,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-17 08:10:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2023-02-17 08:10:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 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,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2023-02-17 08:10:02,245 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 16 [2023-02-17 08:10:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:02,245 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2023-02-17 08:10:02,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2023-02-17 08:10:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 08:10:02,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:02,246 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:02,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-17 08:10:02,446 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:10:02,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash -749049092, now seen corresponding path program 1 times [2023-02-17 08:10:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:02,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757437463] [2023-02-17 08:10:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:02,448 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,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:02,449 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:10:02,450 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:10:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:02,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 08:10:02,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:10:02,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:10:02,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:02,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757437463] [2023-02-17 08:10:02,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757437463] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:02,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:02,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-02-17 08:10:02,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467631547] [2023-02-17 08:10:02,630 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:02,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:10:02,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:02,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:10:02,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:10:02,631 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:03,009 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2023-02-17 08:10:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 08:10:03,010 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-17 08:10:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:03,011 INFO L225 Difference]: With dead ends: 116 [2023-02-17 08:10:03,011 INFO L226 Difference]: Without dead ends: 116 [2023-02-17 08:10:03,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-02-17 08:10:03,012 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 205 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:03,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 301 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 08:10:03,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-17 08:10:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2023-02-17 08:10:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 93 states have internal predecessors, (108), 0 states have call successors, (0), 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:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2023-02-17 08:10:03,015 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 16 [2023-02-17 08:10:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:03,016 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2023-02-17 08:10:03,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2023-02-17 08:10:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 08:10:03,017 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:03,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:03,025 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:10:03,225 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:10:03,225 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -302012765, now seen corresponding path program 1 times [2023-02-17 08:10:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:03,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005660059] [2023-02-17 08:10:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:03,226 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:03,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:03,227 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:10:03,227 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:10:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:03,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:10:03,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:10:03,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:03,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-02-17 08:10:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:10:03,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:03,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005660059] [2023-02-17 08:10:03,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005660059] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:03,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:03,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-17 08:10:03,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526757918] [2023-02-17 08:10:03,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:03,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:10:03,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:03,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:10:03,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:10:03,383 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:03,862 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2023-02-17 08:10:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:10:03,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-17 08:10:03,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:03,864 INFO L225 Difference]: With dead ends: 151 [2023-02-17 08:10:03,864 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 08:10:03,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:10:03,865 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 159 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:03,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 154 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:10:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 08:10:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 105. [2023-02-17 08:10:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 104 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:10:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2023-02-17 08:10:03,868 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 20 [2023-02-17 08:10:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:03,868 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2023-02-17 08:10:03,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2023-02-17 08:10:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-17 08:10:03,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:03,869 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:03,883 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:10:04,079 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:10:04,079 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1581646975, now seen corresponding path program 2 times [2023-02-17 08:10:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:04,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393956211] [2023-02-17 08:10:04,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:10:04,080 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:04,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:04,081 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:10:04,082 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:10:04,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:10:04,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:04,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:10:04,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:04,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:04,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2023-02-17 08:10:04,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:10:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:10:04,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:04,353 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:10:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:10:04,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:04,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393956211] [2023-02-17 08:10:04,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393956211] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:04,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:04,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-17 08:10:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315616871] [2023-02-17 08:10:04,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:10:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:04,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:10:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:10:04,395 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:06,212 INFO L93 Difference]: Finished difference Result 233 states and 289 transitions. [2023-02-17 08:10:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:10:06,212 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-17 08:10:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:06,217 INFO L225 Difference]: With dead ends: 233 [2023-02-17 08:10:06,217 INFO L226 Difference]: Without dead ends: 233 [2023-02-17 08:10:06,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:10:06,218 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 525 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:06,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 147 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-17 08:10:06,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-17 08:10:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 169. [2023-02-17 08:10:06,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 155 states have (on average 1.4387096774193548) internal successors, (223), 168 states have internal predecessors, (223), 0 states have call successors, (0), 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:06,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 223 transitions. [2023-02-17 08:10:06,227 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 223 transitions. Word has length 20 [2023-02-17 08:10:06,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:06,227 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 223 transitions. [2023-02-17 08:10:06,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 223 transitions. [2023-02-17 08:10:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:10:06,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:06,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:06,237 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:06,433 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:06,433 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:06,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1786415948, now seen corresponding path program 1 times [2023-02-17 08:10:06,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:06,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901653418] [2023-02-17 08:10:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:06,434 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:06,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:06,436 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:06,439 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:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:06,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 08:10:06,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:06,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:06,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 29 [2023-02-17 08:10:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:10:06,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:10:06,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:06,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901653418] [2023-02-17 08:10:06,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901653418] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:06,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:06,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-02-17 08:10:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624323536] [2023-02-17 08:10:06,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:06,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 08:10:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 08:10:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:10:06,735 INFO L87 Difference]: Start difference. First operand 169 states and 223 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:08,624 INFO L93 Difference]: Finished difference Result 219 states and 260 transitions. [2023-02-17 08:10:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:10:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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 21 [2023-02-17 08:10:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:08,627 INFO L225 Difference]: With dead ends: 219 [2023-02-17 08:10:08,627 INFO L226 Difference]: Without dead ends: 219 [2023-02-17 08:10:08,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-02-17 08:10:08,628 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 515 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:08,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 198 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-17 08:10:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-17 08:10:08,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 184. [2023-02-17 08:10:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 170 states have (on average 1.4294117647058824) internal successors, (243), 183 states have internal predecessors, (243), 0 states have call successors, (0), 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:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2023-02-17 08:10:08,633 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 21 [2023-02-17 08:10:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:08,633 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2023-02-17 08:10:08,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 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:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2023-02-17 08:10:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 08:10:08,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:08,634 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-17 08:10:08,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-17 08:10:08,841 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:08,841 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash 302966996, now seen corresponding path program 2 times [2023-02-17 08:10:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:08,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115221446] [2023-02-17 08:10:08,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:10:08,842 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:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:08,843 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:08,844 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:08,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:10:08,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:08,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 08:10:08,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:08,916 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:09,011 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:10:09,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:09,484 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:10:09,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:09,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115221446] [2023-02-17 08:10:09,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115221446] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:09,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:09,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-17 08:10:09,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062628064] [2023-02-17 08:10:09,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:09,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 08:10:09,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:09,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 08:10:09,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:10:09,485 INFO L87 Difference]: Start difference. First operand 184 states and 243 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:10:13,938 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:10:16,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:16,805 INFO L93 Difference]: Finished difference Result 633 states and 856 transitions. [2023-02-17 08:10:16,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 08:10:16,806 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:10:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:16,809 INFO L225 Difference]: With dead ends: 633 [2023-02-17 08:10:16,809 INFO L226 Difference]: Without dead ends: 633 [2023-02-17 08:10:16,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2023-02-17 08:10:16,810 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 1135 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:16,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 558 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 518 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2023-02-17 08:10:16,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2023-02-17 08:10:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 208. [2023-02-17 08:10:16,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 194 states have (on average 1.407216494845361) internal successors, (273), 207 states have internal predecessors, (273), 0 states have call successors, (0), 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:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 273 transitions. [2023-02-17 08:10:16,821 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 273 transitions. Word has length 22 [2023-02-17 08:10:16,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:16,821 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 273 transitions. [2023-02-17 08:10:16,821 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:10:16,822 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2023-02-17 08:10:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 08:10:16,822 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:16,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:16,842 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 (18)] Forceful destruction successful, exit code 0 [2023-02-17 08:10:17,032 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:17,032 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:17,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:17,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1242696241, now seen corresponding path program 1 times [2023-02-17 08:10:17,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:17,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825461543] [2023-02-17 08:10:17,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:17,033 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:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:17,034 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:17,035 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:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:17,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:10:17,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:17,128 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:17,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-02-17 08:10:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:10:17,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:17,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:10:17,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825461543] [2023-02-17 08:10:17,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825461543] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:17,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:17,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-17 08:10:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559898340] [2023-02-17 08:10:17,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:17,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 08:10:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 08:10:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:10:17,398 INFO L87 Difference]: Start difference. First operand 208 states and 273 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 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:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:18,897 INFO L93 Difference]: Finished difference Result 245 states and 308 transitions. [2023-02-17 08:10:18,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 08:10:18,898 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-17 08:10:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:18,899 INFO L225 Difference]: With dead ends: 245 [2023-02-17 08:10:18,899 INFO L226 Difference]: Without dead ends: 245 [2023-02-17 08:10:18,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2023-02-17 08:10:18,900 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 433 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:18,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 333 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-17 08:10:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-17 08:10:18,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 155. [2023-02-17 08:10:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 141 states have (on average 1.3687943262411348) internal successors, (193), 154 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 193 transitions. [2023-02-17 08:10:18,904 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 193 transitions. Word has length 23 [2023-02-17 08:10:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:18,904 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 193 transitions. [2023-02-17 08:10:18,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 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:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 193 transitions. [2023-02-17 08:10:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 08:10:18,905 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:18,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:18,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-17 08:10:19,114 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:19,115 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1547664583, now seen corresponding path program 1 times [2023-02-17 08:10:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:19,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451645959] [2023-02-17 08:10:19,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:19,116 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:19,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:19,117 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:19,120 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:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:19,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:10:19,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:19,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:10:19,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:19,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:19,252 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:10:19,253 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:10:19,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 55 [2023-02-17 08:10:19,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2023-02-17 08:10:19,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:19,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 26 [2023-02-17 08:10:19,311 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:10:19,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:19,368 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_340 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_340) |c_ULTIMATE.start_lis_~best~0#1.base|)) (.cse1 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (bvmul (_ bv4 32) (_ bv0 32))))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) .cse1)) (select .cse0 (bvadd (_ bv2 32) .cse1))) (select .cse0 (bvadd (_ bv1 32) .cse1))) (select .cse0 .cse1))))) is different from false [2023-02-17 08:10:19,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:10:19,376 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:10:19,377 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:10:19,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:19,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:19,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:19,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 231 treesize of output 118 [2023-02-17 08:10:19,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:19,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 154 treesize of output 382 [2023-02-17 08:10:22,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 9 [2023-02-17 08:10:40,798 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:10:40,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:40,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451645959] [2023-02-17 08:10:40,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451645959] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:40,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:40,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 08:10:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630946088] [2023-02-17 08:10:40,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:40,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:10:40,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:40,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:10:40,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2023-02-17 08:10:40,809 INFO L87 Difference]: Start difference. First operand 155 states and 193 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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:42,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:10:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:44,055 INFO L93 Difference]: Finished difference Result 197 states and 246 transitions. [2023-02-17 08:10:44,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:10:44,056 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-17 08:10:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:44,056 INFO L225 Difference]: With dead ends: 197 [2023-02-17 08:10:44,056 INFO L226 Difference]: Without dead ends: 197 [2023-02-17 08:10:44,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=142, Unknown=1, NotChecked=26, Total=240 [2023-02-17 08:10:44,057 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:44,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 304 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 270 Invalid, 0 Unknown, 52 Unchecked, 3.1s Time] [2023-02-17 08:10:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-17 08:10:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 179. [2023-02-17 08:10:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 165 states have (on average 1.4181818181818182) internal successors, (234), 178 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 234 transitions. [2023-02-17 08:10:44,061 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 234 transitions. Word has length 26 [2023-02-17 08:10:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:44,062 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 234 transitions. [2023-02-17 08:10:44,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 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:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 234 transitions. [2023-02-17 08:10:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:10:44,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:44,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:44,073 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:44,272 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:44,272 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844182, now seen corresponding path program 2 times [2023-02-17 08:10:44,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:44,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456107261] [2023-02-17 08:10:44,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:10:44,273 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:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:44,274 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:44,275 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:44,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 08:10:44,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:10:44,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:10:44,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:44,339 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:10:44,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:44,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 74 [2023-02-17 08:10:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 08:10:44,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:10:44,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:44,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456107261] [2023-02-17 08:10:44,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456107261] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:10:44,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:10:44,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:10:44,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81960272] [2023-02-17 08:10:44,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:10:44,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:10:44,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:10:44,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:10:44,624 INFO L87 Difference]: Start difference. First operand 179 states and 234 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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:10:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:44,751 INFO L93 Difference]: Finished difference Result 177 states and 224 transitions. [2023-02-17 08:10:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:10:44,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 27 [2023-02-17 08:10:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:44,752 INFO L225 Difference]: With dead ends: 177 [2023-02-17 08:10:44,752 INFO L226 Difference]: Without dead ends: 177 [2023-02-17 08:10:44,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:10:44,753 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 83 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:44,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:10:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-17 08:10:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-02-17 08:10:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 165 states have (on average 1.3575757575757577) internal successors, (224), 176 states have internal predecessors, (224), 0 states have call successors, (0), 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:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 224 transitions. [2023-02-17 08:10:44,756 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 224 transitions. Word has length 27 [2023-02-17 08:10:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:44,756 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 224 transitions. [2023-02-17 08:10:44,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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:10:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 224 transitions. [2023-02-17 08:10:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:10:44,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:44,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:44,772 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:10:44,957 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:10:44,958 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844181, now seen corresponding path program 1 times [2023-02-17 08:10:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:44,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216414549] [2023-02-17 08:10:44,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:44,958 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:44,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:44,959 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:10:44,961 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:10:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:45,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 08:10:45,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:45,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:10:45,091 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:45,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:10:45,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:45,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 64 [2023-02-17 08:10:45,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:10:45,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:10:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:10:45,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:10:45,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:10:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:10:45,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:45,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216414549] [2023-02-17 08:10:45,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1216414549] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:10:45,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:10:45,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2023-02-17 08:10:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75677788] [2023-02-17 08:10:45,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:10:45,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:10:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:10:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:10:45,714 INFO L87 Difference]: Start difference. First operand 177 states and 224 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 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:47,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:10:47,078 INFO L93 Difference]: Finished difference Result 243 states and 303 transitions. [2023-02-17 08:10:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:10:47,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-17 08:10:47,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:10:47,081 INFO L225 Difference]: With dead ends: 243 [2023-02-17 08:10:47,081 INFO L226 Difference]: Without dead ends: 243 [2023-02-17 08:10:47,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-02-17 08:10:47,082 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 239 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:10:47,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 170 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-17 08:10:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-17 08:10:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 182. [2023-02-17 08:10:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 170 states have (on average 1.3470588235294119) internal successors, (229), 181 states have internal predecessors, (229), 0 states have call successors, (0), 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:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 229 transitions. [2023-02-17 08:10:47,088 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 229 transitions. Word has length 27 [2023-02-17 08:10:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:10:47,089 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 229 transitions. [2023-02-17 08:10:47,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 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:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 229 transitions. [2023-02-17 08:10:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 08:10:47,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:10:47,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:10:47,103 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:10:47,301 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:10:47,301 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:10:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:10:47,302 INFO L85 PathProgramCache]: Analyzing trace with hash -397297604, now seen corresponding path program 1 times [2023-02-17 08:10:47,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:10:47,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517591199] [2023-02-17 08:10:47,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:10:47,302 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:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:10:47,303 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:10:47,305 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:10:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:10:47,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 08:10:47,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:10:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 08:10:53,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:10:53,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:10:53,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517591199] [2023-02-17 08:10:53,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517591199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:10:53,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:10:53,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:10:53,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114080223] [2023-02-17 08:10:53,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:10:53,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:10:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:10:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:10:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2023-02-17 08:10:53,492 INFO L87 Difference]: Start difference. First operand 182 states and 229 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:10:55,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:10:57,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:10:59,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:01,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:03,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:05,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:07,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:09,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:11,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:13,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:15,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 08:11:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:15,722 INFO L93 Difference]: Finished difference Result 181 states and 228 transitions. [2023-02-17 08:11:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:11:15,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-17 08:11:15,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:15,726 INFO L225 Difference]: With dead ends: 181 [2023-02-17 08:11:15,726 INFO L226 Difference]: Without dead ends: 156 [2023-02-17 08:11:15,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2023-02-17 08:11:15,727 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:15,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 164 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 12 Unknown, 0 Unchecked, 22.2s Time] [2023-02-17 08:11:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-17 08:11:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-02-17 08:11:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 155 states have internal predecessors, (199), 0 states have call successors, (0), 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:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 199 transitions. [2023-02-17 08:11:15,742 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 199 transitions. Word has length 28 [2023-02-17 08:11:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:15,742 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 199 transitions. [2023-02-17 08:11:15,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:15,743 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 199 transitions. [2023-02-17 08:11:15,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 08:11:15,743 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:15,743 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:15,753 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:11:15,951 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:11:15,951 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 543568764, now seen corresponding path program 1 times [2023-02-17 08:11:15,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:15,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436148980] [2023-02-17 08:11:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:11:15,952 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:15,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:15,953 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:11:15,954 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:11:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:11:16,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:11:16,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 08:11:16,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:11:16,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:16,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436148980] [2023-02-17 08:11:16,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436148980] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:11:16,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:11:16,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 08:11:16,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11525487] [2023-02-17 08:11:16,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:11:16,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:11:16,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:16,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:11:16,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:11:16,062 INFO L87 Difference]: Start difference. First operand 156 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:16,299 INFO L93 Difference]: Finished difference Result 227 states and 288 transitions. [2023-02-17 08:11:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:11:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-17 08:11:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:16,301 INFO L225 Difference]: With dead ends: 227 [2023-02-17 08:11:16,301 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 08:11:16,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:11:16,302 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 258 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:16,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 81 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:11:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 08:11:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 159. [2023-02-17 08:11:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 148 states have (on average 1.364864864864865) internal successors, (202), 158 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 202 transitions. [2023-02-17 08:11:16,306 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 202 transitions. Word has length 28 [2023-02-17 08:11:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:16,306 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 202 transitions. [2023-02-17 08:11:16,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 202 transitions. [2023-02-17 08:11:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 08:11:16,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:16,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:16,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:16,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:11:16,516 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:16,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1430352431, now seen corresponding path program 1 times [2023-02-17 08:11:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:16,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694145397] [2023-02-17 08:11:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:11:16,517 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:16,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:16,518 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:11:16,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-17 08:11:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:11:16,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:11:16,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:11:16,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:16,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-02-17 08:11:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:11:16,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:16,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694145397] [2023-02-17 08:11:16,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694145397] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:16,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:16,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-17 08:11:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100197391] [2023-02-17 08:11:16,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:16,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:11:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:11:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:11:16,752 INFO L87 Difference]: Start difference. First operand 159 states and 202 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 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:11:17,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:17,673 INFO L93 Difference]: Finished difference Result 389 states and 502 transitions. [2023-02-17 08:11:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 08:11:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 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) Word has length 31 [2023-02-17 08:11:17,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:17,675 INFO L225 Difference]: With dead ends: 389 [2023-02-17 08:11:17,675 INFO L226 Difference]: Without dead ends: 389 [2023-02-17 08:11:17,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:11:17,676 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 375 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:17,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 159 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 08:11:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-02-17 08:11:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 165. [2023-02-17 08:11:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 164 states have internal predecessors, (209), 0 states have call successors, (0), 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:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2023-02-17 08:11:17,681 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 31 [2023-02-17 08:11:17,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:17,682 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2023-02-17 08:11:17,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 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:11:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2023-02-17 08:11:17,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 08:11:17,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:17,682 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:17,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:17,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:11:17,895 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:17,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1391261449, now seen corresponding path program 1 times [2023-02-17 08:11:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:17,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941955354] [2023-02-17 08:11:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:11:17,896 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:17,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:17,898 INFO L229 MonitoredProcess]: Starting monitored process 26 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:17,901 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 (26)] Waiting until timeout for monitored process [2023-02-17 08:11:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:11:18,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 08:11:18,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 08:11:18,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:11:18,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:18,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941955354] [2023-02-17 08:11:18,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941955354] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:11:18,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:11:18,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:11:18,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706502476] [2023-02-17 08:11:18,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:11:18,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 08:11:18,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:18,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 08:11:18,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 08:11:18,012 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:18,021 INFO L93 Difference]: Finished difference Result 165 states and 206 transitions. [2023-02-17 08:11:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 08:11:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-17 08:11:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:18,023 INFO L225 Difference]: With dead ends: 165 [2023-02-17 08:11:18,023 INFO L226 Difference]: Without dead ends: 165 [2023-02-17 08:11:18,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:11:18,024 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:18,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:11:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-17 08:11:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-02-17 08:11:18,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 155 states have (on average 1.3290322580645162) internal successors, (206), 164 states have internal predecessors, (206), 0 states have call successors, (0), 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:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 206 transitions. [2023-02-17 08:11:18,027 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 206 transitions. Word has length 32 [2023-02-17 08:11:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:18,028 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 206 transitions. [2023-02-17 08:11:18,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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:18,029 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 206 transitions. [2023-02-17 08:11:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 08:11:18,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:18,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:18,039 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 (26)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:18,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:18,230 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1391252418, now seen corresponding path program 1 times [2023-02-17 08:11:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:18,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580613549] [2023-02-17 08:11:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:11:18,231 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:18,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:18,232 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:11:18,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-17 08:11:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:11:18,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:11:18,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:18,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:11:18,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:18,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-02-17 08:11:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:11:18,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:18,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580613549] [2023-02-17 08:11:18,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580613549] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:18,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:18,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-17 08:11:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690921641] [2023-02-17 08:11:18,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:18,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:11:18,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:18,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:11:18,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:11:18,453 INFO L87 Difference]: Start difference. First operand 165 states and 206 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:19,526 INFO L93 Difference]: Finished difference Result 626 states and 789 transitions. [2023-02-17 08:11:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 08:11:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-17 08:11:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:19,528 INFO L225 Difference]: With dead ends: 626 [2023-02-17 08:11:19,528 INFO L226 Difference]: Without dead ends: 626 [2023-02-17 08:11:19,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2023-02-17 08:11:19,529 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1092 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:19,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 161 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 08:11:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-02-17 08:11:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 226. [2023-02-17 08:11:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 217 states have (on average 1.3502304147465438) internal successors, (293), 225 states have internal predecessors, (293), 0 states have call successors, (0), 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:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 293 transitions. [2023-02-17 08:11:19,535 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 293 transitions. Word has length 32 [2023-02-17 08:11:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:19,536 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 293 transitions. [2023-02-17 08:11:19,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 293 transitions. [2023-02-17 08:11:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 08:11:19,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:19,536 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:19,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:19,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:11:19,747 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:19,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:19,747 INFO L85 PathProgramCache]: Analyzing trace with hash 155161166, now seen corresponding path program 3 times [2023-02-17 08:11:19,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:19,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799418562] [2023-02-17 08:11:19,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 08:11:19,748 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:19,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:19,749 INFO L229 MonitoredProcess]: Starting monitored process 28 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:19,750 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 (28)] Waiting until timeout for monitored process [2023-02-17 08:11:19,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-17 08:11:19,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:11:19,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 08:11:19,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:19,940 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:19,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:11:19,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:11:19,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 64 [2023-02-17 08:11:20,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:11:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:11:20,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:20,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:11:20,878 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:11:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:11:20,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:20,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799418562] [2023-02-17 08:11:20,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799418562] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:20,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:20,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2023-02-17 08:11:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384973507] [2023-02-17 08:11:20,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:20,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 08:11:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:20,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 08:11:20,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2023-02-17 08:11:20,883 INFO L87 Difference]: Start difference. First operand 226 states and 293 transitions. Second operand has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 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:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:23,394 INFO L93 Difference]: Finished difference Result 346 states and 437 transitions. [2023-02-17 08:11:23,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 08:11:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-17 08:11:23,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:23,396 INFO L225 Difference]: With dead ends: 346 [2023-02-17 08:11:23,396 INFO L226 Difference]: Without dead ends: 324 [2023-02-17 08:11:23,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 08:11:23,397 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 540 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:23,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 321 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-17 08:11:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-02-17 08:11:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 301. [2023-02-17 08:11:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 292 states have (on average 1.3184931506849316) internal successors, (385), 300 states have internal predecessors, (385), 0 states have call successors, (0), 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:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 385 transitions. [2023-02-17 08:11:23,402 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 385 transitions. Word has length 32 [2023-02-17 08:11:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:23,402 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 385 transitions. [2023-02-17 08:11:23,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 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:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 385 transitions. [2023-02-17 08:11:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 08:11:23,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:23,403 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:23,416 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 (28)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:23,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:23,613 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:23,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 646893308, now seen corresponding path program 1 times [2023-02-17 08:11:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:23,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017519859] [2023-02-17 08:11:23,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:11:23,614 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:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:23,615 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:11:23,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-17 08:11:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:11:23,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:11:23,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 08:11:23,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:23,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 08:11:23,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:23,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017519859] [2023-02-17 08:11:23,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017519859] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:23,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:23,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-17 08:11:23,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606627537] [2023-02-17 08:11:23,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:23,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:11:23,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:23,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:11:23,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-17 08:11:23,742 INFO L87 Difference]: Start difference. First operand 301 states and 385 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:23,983 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions. [2023-02-17 08:11:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:11:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-17 08:11:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:23,984 INFO L225 Difference]: With dead ends: 278 [2023-02-17 08:11:23,984 INFO L226 Difference]: Without dead ends: 273 [2023-02-17 08:11:23,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 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:11:23,984 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:23,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 149 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:11:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-17 08:11:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 265. [2023-02-17 08:11:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 256 states have (on average 1.30859375) internal successors, (335), 264 states have internal predecessors, (335), 0 states have call successors, (0), 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:23,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 335 transitions. [2023-02-17 08:11:23,989 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 335 transitions. Word has length 35 [2023-02-17 08:11:23,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:23,989 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 335 transitions. [2023-02-17 08:11:23,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:23,990 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 335 transitions. [2023-02-17 08:11:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 08:11:23,990 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:23,990 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:24,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:24,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:11:24,200 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 770896954, now seen corresponding path program 2 times [2023-02-17 08:11:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:24,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728869524] [2023-02-17 08:11:24,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:11:24,201 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:24,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:24,202 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:11:24,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-17 08:11:24,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 08:11:24,292 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:11:24,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 08:11:24,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:24,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:11:24,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-02-17 08:11:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-17 08:11:24,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:24,515 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:11:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2023-02-17 08:11:24,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:24,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728869524] [2023-02-17 08:11:24,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728869524] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:24,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:24,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2023-02-17 08:11:24,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736975386] [2023-02-17 08:11:24,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:24,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 08:11:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:24,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 08:11:24,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 08:11:24,521 INFO L87 Difference]: Start difference. First operand 265 states and 335 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:25,091 INFO L93 Difference]: Finished difference Result 268 states and 334 transitions. [2023-02-17 08:11:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:11:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-17 08:11:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:25,093 INFO L225 Difference]: With dead ends: 268 [2023-02-17 08:11:25,093 INFO L226 Difference]: Without dead ends: 243 [2023-02-17 08:11:25,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-17 08:11:25,094 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 137 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:25,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 59 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:11:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-17 08:11:25,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 215. [2023-02-17 08:11:25,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 208 states have (on average 1.3173076923076923) internal successors, (274), 214 states have internal predecessors, (274), 0 states have call successors, (0), 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:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 274 transitions. [2023-02-17 08:11:25,098 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 274 transitions. Word has length 37 [2023-02-17 08:11:25,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:25,098 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 274 transitions. [2023-02-17 08:11:25,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:25,098 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 274 transitions. [2023-02-17 08:11:25,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 08:11:25,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:25,098 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:25,109 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 (30)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:25,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:11:25,299 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:25,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 601007766, now seen corresponding path program 4 times [2023-02-17 08:11:25,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:25,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833574242] [2023-02-17 08:11:25,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 08:11:25,300 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:25,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:25,301 INFO L229 MonitoredProcess]: Starting monitored process 31 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:25,302 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 (31)] Waiting until timeout for monitored process [2023-02-17 08:11:25,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 08:11:25,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:11:25,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:11:25,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:25,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:11:25,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 29 [2023-02-17 08:11:25,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2023-02-17 08:11:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:11:25,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 29 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-17 08:11:26,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:26,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833574242] [2023-02-17 08:11:26,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833574242] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:26,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:26,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2023-02-17 08:11:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154394965] [2023-02-17 08:11:26,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:26,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 08:11:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:26,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 08:11:26,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2023-02-17 08:11:26,098 INFO L87 Difference]: Start difference. First operand 215 states and 274 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:30,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:30,250 INFO L93 Difference]: Finished difference Result 552 states and 710 transitions. [2023-02-17 08:11:30,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 08:11:30,251 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-17 08:11:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:30,252 INFO L225 Difference]: With dead ends: 552 [2023-02-17 08:11:30,253 INFO L226 Difference]: Without dead ends: 510 [2023-02-17 08:11:30,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=449, Invalid=1531, Unknown=0, NotChecked=0, Total=1980 [2023-02-17 08:11:30,254 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 670 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:30,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 630 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-02-17 08:11:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-02-17 08:11:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 370. [2023-02-17 08:11:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 363 states have (on average 1.3388429752066116) internal successors, (486), 369 states have internal predecessors, (486), 0 states have call successors, (0), 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:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 486 transitions. [2023-02-17 08:11:30,270 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 486 transitions. Word has length 40 [2023-02-17 08:11:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:30,270 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 486 transitions. [2023-02-17 08:11:30,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:11:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 486 transitions. [2023-02-17 08:11:30,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 08:11:30,271 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:30,271 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:30,282 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 (31)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:30,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:30,482 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash -528832743, now seen corresponding path program 5 times [2023-02-17 08:11:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:30,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199644190] [2023-02-17 08:11:30,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-17 08:11:30,483 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:30,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:30,484 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:11:30,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-17 08:11:30,753 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-17 08:11:30,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:11:30,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 08:11:30,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:30,770 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:30,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-02-17 08:11:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 21 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 08:11:30,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 15 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:11:32,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:32,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199644190] [2023-02-17 08:11:32,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199644190] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:32,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:32,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2023-02-17 08:11:32,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064471395] [2023-02-17 08:11:32,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:32,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-17 08:11:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:32,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-17 08:11:32,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=780, Unknown=0, NotChecked=0, Total=930 [2023-02-17 08:11:32,013 INFO L87 Difference]: Start difference. First operand 370 states and 486 transitions. Second operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 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:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:36,955 INFO L93 Difference]: Finished difference Result 944 states and 1239 transitions. [2023-02-17 08:11:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-17 08:11:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 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 44 [2023-02-17 08:11:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:36,958 INFO L225 Difference]: With dead ends: 944 [2023-02-17 08:11:36,958 INFO L226 Difference]: Without dead ends: 939 [2023-02-17 08:11:36,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=666, Invalid=2756, Unknown=0, NotChecked=0, Total=3422 [2023-02-17 08:11:36,959 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1338 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1338 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:36,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1338 Valid, 985 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-02-17 08:11:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-02-17 08:11:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 659. [2023-02-17 08:11:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 652 states have (on average 1.3374233128834356) internal successors, (872), 658 states have internal predecessors, (872), 0 states have call successors, (0), 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:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 872 transitions. [2023-02-17 08:11:36,969 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 872 transitions. Word has length 44 [2023-02-17 08:11:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:36,970 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 872 transitions. [2023-02-17 08:11:36,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 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:36,970 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 872 transitions. [2023-02-17 08:11:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 08:11:36,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:36,971 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:11:36,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:37,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:11:37,182 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:37,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash -484234273, now seen corresponding path program 1 times [2023-02-17 08:11:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:37,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868836646] [2023-02-17 08:11:37,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:11:37,183 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:37,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:37,184 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:11:37,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-17 08:11:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:11:37,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 08:11:37,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:37,357 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:37,361 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:11:37,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:11:37,394 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:11:37,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 64 [2023-02-17 08:11:37,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:11:37,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:11:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 08:11:37,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:38,409 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:11:38,413 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:11:38,416 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:11:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 08:11:38,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:38,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868836646] [2023-02-17 08:11:38,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868836646] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:38,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:38,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-17 08:11:38,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980813793] [2023-02-17 08:11:38,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:38,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 08:11:38,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:38,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 08:11:38,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:11:38,422 INFO L87 Difference]: Start difference. First operand 659 states and 872 transitions. Second operand has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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:11:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:11:39,693 INFO L93 Difference]: Finished difference Result 775 states and 1026 transitions. [2023-02-17 08:11:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 08:11:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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 45 [2023-02-17 08:11:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:11:39,697 INFO L225 Difference]: With dead ends: 775 [2023-02-17 08:11:39,697 INFO L226 Difference]: Without dead ends: 775 [2023-02-17 08:11:39,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2023-02-17 08:11:39,698 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 275 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:11:39,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 198 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 08:11:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-02-17 08:11:39,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 667. [2023-02-17 08:11:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 660 states have (on average 1.3333333333333333) internal successors, (880), 666 states have internal predecessors, (880), 0 states have call successors, (0), 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:39,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 880 transitions. [2023-02-17 08:11:39,708 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 880 transitions. Word has length 45 [2023-02-17 08:11:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:11:39,708 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 880 transitions. [2023-02-17 08:11:39,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.235294117647059) internal successors, (72), 18 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:11:39,709 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 880 transitions. [2023-02-17 08:11:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:11:39,709 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:11:39,709 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1] [2023-02-17 08:11:39,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-02-17 08:11:39,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:11:39,921 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:11:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:11:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1048882662, now seen corresponding path program 3 times [2023-02-17 08:11:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:11:39,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523941418] [2023-02-17 08:11:39,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 08:11:39,922 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:39,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:11:39,923 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:11:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-17 08:11:40,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-17 08:11:40,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:11:40,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 08:11:40,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:11:40,116 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:40,299 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:11:40,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:11:41,555 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:11:41,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:11:41,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523941418] [2023-02-17 08:11:41,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523941418] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:11:41,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:11:41,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-02-17 08:11:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183176386] [2023-02-17 08:11:41,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:11:41,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-17 08:11:41,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:11:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-17 08:11:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2023-02-17 08:11:41,557 INFO L87 Difference]: Start difference. First operand 667 states and 880 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:11:43,855 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:47,141 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:49,601 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:51,882 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,256 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,725 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:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:05,312 INFO L93 Difference]: Finished difference Result 1260 states and 1645 transitions. [2023-02-17 08:12:05,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-17 08:12:05,313 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:12:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:05,316 INFO L225 Difference]: With dead ends: 1260 [2023-02-17 08:12:05,316 INFO L226 Difference]: Without dead ends: 1260 [2023-02-17 08:12:05,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1166, Invalid=2494, Unknown=0, NotChecked=0, Total=3660 [2023-02-17 08:12:05,318 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 924 mSDsluCounter, 1560 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 98 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:05,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1667 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1827 Invalid, 6 Unknown, 0 Unchecked, 18.3s Time] [2023-02-17 08:12:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2023-02-17 08:12:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 715. [2023-02-17 08:12:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 708 states have (on average 1.3276836158192091) internal successors, (940), 714 states have internal predecessors, (940), 0 states have call successors, (0), 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:12:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 940 transitions. [2023-02-17 08:12:05,329 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 940 transitions. Word has length 46 [2023-02-17 08:12:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:05,329 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 940 transitions. [2023-02-17 08:12:05,329 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:12:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 940 transitions. [2023-02-17 08:12:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:12:05,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:05,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:05,343 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 (34)] Forceful destruction successful, exit code 0 [2023-02-17 08:12:05,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:05,541 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:05,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:05,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1686115654, now seen corresponding path program 1 times [2023-02-17 08:12:05,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:05,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022276801] [2023-02-17 08:12:05,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:12:05,542 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:12:05,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:05,543 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:05,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-17 08:12:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:12:05,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 08:12:05,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 08:12:05,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:05,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2023-02-17 08:12:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 08:12:06,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:06,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022276801] [2023-02-17 08:12:06,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022276801] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:06,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:06,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-17 08:12:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852551831] [2023-02-17 08:12:06,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:06,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 08:12:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:06,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 08:12:06,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:12:06,092 INFO L87 Difference]: Start difference. First operand 715 states and 940 transitions. Second operand has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 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:12:12,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:12,811 INFO L93 Difference]: Finished difference Result 1711 states and 2266 transitions. [2023-02-17 08:12:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-17 08:12:12,811 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 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:12:12,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:12,815 INFO L225 Difference]: With dead ends: 1711 [2023-02-17 08:12:12,815 INFO L226 Difference]: Without dead ends: 1711 [2023-02-17 08:12:12,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 08:12:12,816 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 1054 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:12,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 353 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-02-17 08:12:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2023-02-17 08:12:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 922. [2023-02-17 08:12:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 915 states have (on average 1.3420765027322403) internal successors, (1228), 921 states have internal predecessors, (1228), 0 states have call successors, (0), 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:12:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1228 transitions. [2023-02-17 08:12:12,831 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1228 transitions. Word has length 46 [2023-02-17 08:12:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:12,831 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1228 transitions. [2023-02-17 08:12:12,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.9411764705882355) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 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:12:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1228 transitions. [2023-02-17 08:12:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 08:12:12,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:12,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:12,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-02-17 08:12:13,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:13,044 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:13,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:13,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2126360568, now seen corresponding path program 1 times [2023-02-17 08:12:13,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:13,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082817303] [2023-02-17 08:12:13,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:12:13,045 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:12:13,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:13,046 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:13,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-17 08:12:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:12:13,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 08:12:13,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 08:12:13,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:13,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2023-02-17 08:12:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 08:12:13,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:13,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082817303] [2023-02-17 08:12:13,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082817303] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:13,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:13,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-17 08:12:13,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083837389] [2023-02-17 08:12:13,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:13,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:12:13,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:12:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:12:13,335 INFO L87 Difference]: Start difference. First operand 922 states and 1228 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 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:12:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:13,898 INFO L93 Difference]: Finished difference Result 1138 states and 1435 transitions. [2023-02-17 08:12:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 08:12:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 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) Word has length 46 [2023-02-17 08:12:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:13,902 INFO L225 Difference]: With dead ends: 1138 [2023-02-17 08:12:13,902 INFO L226 Difference]: Without dead ends: 1138 [2023-02-17 08:12:13,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2023-02-17 08:12:13,902 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 409 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:13,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 156 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:12:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2023-02-17 08:12:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 922. [2023-02-17 08:12:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 915 states have (on average 1.2972677595628415) internal successors, (1187), 921 states have internal predecessors, (1187), 0 states have call successors, (0), 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:12:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1187 transitions. [2023-02-17 08:12:13,914 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1187 transitions. Word has length 46 [2023-02-17 08:12:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:13,914 INFO L495 AbstractCegarLoop]: Abstraction has 922 states and 1187 transitions. [2023-02-17 08:12:13,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 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:12:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1187 transitions. [2023-02-17 08:12:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-17 08:12:13,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:13,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:13,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-02-17 08:12:14,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:14,127 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 971260211, now seen corresponding path program 2 times [2023-02-17 08:12:14,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:14,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033930827] [2023-02-17 08:12:14,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:12:14,128 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:12:14,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:14,129 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:14,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-17 08:12:14,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 08:12:14,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:12:14,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 08:12:14,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:14,235 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:12:14,238 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:12:14,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:12:14,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:12:14,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 55 [2023-02-17 08:12:14,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:12:14,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:12:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-17 08:12:14,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:14,841 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:12:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-17 08:12:14,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033930827] [2023-02-17 08:12:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033930827] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:14,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:14,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-17 08:12:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528512420] [2023-02-17 08:12:14,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:14,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:12:14,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:14,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:12:14,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:12:14,986 INFO L87 Difference]: Start difference. First operand 922 states and 1187 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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:12:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:15,621 INFO L93 Difference]: Finished difference Result 940 states and 1196 transitions. [2023-02-17 08:12:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:12:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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:12:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:15,625 INFO L225 Difference]: With dead ends: 940 [2023-02-17 08:12:15,625 INFO L226 Difference]: Without dead ends: 940 [2023-02-17 08:12:15,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:12:15,625 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 377 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:15,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 51 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 08:12:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-02-17 08:12:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 921. [2023-02-17 08:12:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 915 states have (on average 1.2863387978142076) internal successors, (1177), 920 states have internal predecessors, (1177), 0 states have call successors, (0), 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:12:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1177 transitions. [2023-02-17 08:12:15,647 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1177 transitions. Word has length 48 [2023-02-17 08:12:15,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:15,647 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1177 transitions. [2023-02-17 08:12:15,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 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:12:15,647 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1177 transitions. [2023-02-17 08:12:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-17 08:12:15,648 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:15,648 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:15,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-02-17 08:12:15,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:15,857 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:15,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1435611067, now seen corresponding path program 2 times [2023-02-17 08:12:15,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:15,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837399473] [2023-02-17 08:12:15,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:12:15,858 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:12:15,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:15,859 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:15,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-02-17 08:12:15,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:12:15,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:12:15,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:12:15,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:16,017 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-17 08:12:16,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:16,068 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-02-17 08:12:16,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:16,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837399473] [2023-02-17 08:12:16,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837399473] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:16,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:16,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-02-17 08:12:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344643911] [2023-02-17 08:12:16,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:16,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 08:12:16,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:16,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 08:12:16,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-02-17 08:12:16,070 INFO L87 Difference]: Start difference. First operand 921 states and 1177 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 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:12:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:16,276 INFO L93 Difference]: Finished difference Result 922 states and 1175 transitions. [2023-02-17 08:12:16,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:12:16,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 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) Word has length 50 [2023-02-17 08:12:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:16,279 INFO L225 Difference]: With dead ends: 922 [2023-02-17 08:12:16,279 INFO L226 Difference]: Without dead ends: 922 [2023-02-17 08:12:16,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-02-17 08:12:16,279 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 238 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:16,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 98 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:12:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-02-17 08:12:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 921. [2023-02-17 08:12:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 915 states have (on average 1.2830601092896174) internal successors, (1174), 920 states have internal predecessors, (1174), 0 states have call successors, (0), 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:12:16,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1174 transitions. [2023-02-17 08:12:16,290 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1174 transitions. Word has length 50 [2023-02-17 08:12:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:16,291 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 1174 transitions. [2023-02-17 08:12:16,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 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:12:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1174 transitions. [2023-02-17 08:12:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 08:12:16,292 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:16,292 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:16,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-02-17 08:12:16,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:16,503 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:16,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:16,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2080015457, now seen corresponding path program 6 times [2023-02-17 08:12:16,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:16,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98616910] [2023-02-17 08:12:16,504 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-17 08:12:16,504 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:12:16,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:16,505 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:16,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-17 08:12:16,800 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2023-02-17 08:12:16,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:12:16,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 08:12:16,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:16,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:12:16,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 31 [2023-02-17 08:12:16,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-17 08:12:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 08:12:16,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:17,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:12:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-02-17 08:12:17,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:17,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98616910] [2023-02-17 08:12:17,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98616910] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:17,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:17,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-02-17 08:12:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89725834] [2023-02-17 08:12:17,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:17,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-17 08:12:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:17,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-17 08:12:17,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2023-02-17 08:12:17,945 INFO L87 Difference]: Start difference. First operand 921 states and 1174 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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:12:21,627 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:12:23,630 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,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:12:27,234 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:29,237 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,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:12:33,948 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:12:35,951 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:38,819 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:40,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:12:43,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:43,477 INFO L93 Difference]: Finished difference Result 1939 states and 2458 transitions. [2023-02-17 08:12:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-17 08:12:43,478 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-02-17 08:12:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:43,483 INFO L225 Difference]: With dead ends: 1939 [2023-02-17 08:12:43,483 INFO L226 Difference]: Without dead ends: 1910 [2023-02-17 08:12:43,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=635, Invalid=1717, Unknown=0, NotChecked=0, Total=2352 [2023-02-17 08:12:43,485 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 1259 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 151 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:43,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 582 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1207 Invalid, 8 Unknown, 0 Unchecked, 23.0s Time] [2023-02-17 08:12:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1910 states. [2023-02-17 08:12:43,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1910 to 1389. [2023-02-17 08:12:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1383 states have (on average 1.2827187274041938) internal successors, (1774), 1388 states have internal predecessors, (1774), 0 states have call successors, (0), 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:12:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1774 transitions. [2023-02-17 08:12:43,504 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1774 transitions. Word has length 52 [2023-02-17 08:12:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:43,505 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1774 transitions. [2023-02-17 08:12:43,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 0 states have call successors, (0), 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:12:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1774 transitions. [2023-02-17 08:12:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-17 08:12:43,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:43,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:43,522 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 (39)] Forceful destruction successful, exit code 0 [2023-02-17 08:12:43,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:43,721 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:43,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2107734792, now seen corresponding path program 2 times [2023-02-17 08:12:43,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:43,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189802799] [2023-02-17 08:12:43,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 08:12:43,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:12:43,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:43,723 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:43,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-17 08:12:43,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 08:12:43,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:12:43,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:12:43,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-17 08:12:43,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-17 08:12:43,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:43,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189802799] [2023-02-17 08:12:43,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189802799] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:43,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:43,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-17 08:12:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111594323] [2023-02-17 08:12:43,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:43,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:12:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:43,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:12:43,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-17 08:12:43,970 INFO L87 Difference]: Start difference. First operand 1389 states and 1774 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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:12:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:44,437 INFO L93 Difference]: Finished difference Result 1457 states and 1815 transitions. [2023-02-17 08:12:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 08:12:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-02-17 08:12:44,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:44,440 INFO L225 Difference]: With dead ends: 1457 [2023-02-17 08:12:44,440 INFO L226 Difference]: Without dead ends: 1457 [2023-02-17 08:12:44,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-02-17 08:12:44,442 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 137 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:44,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 231 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-17 08:12:44,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2023-02-17 08:12:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1397. [2023-02-17 08:12:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1391 states have (on average 1.2559309849029474) internal successors, (1747), 1396 states have internal predecessors, (1747), 0 states have call successors, (0), 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:12:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1747 transitions. [2023-02-17 08:12:44,456 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1747 transitions. Word has length 60 [2023-02-17 08:12:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:44,456 INFO L495 AbstractCegarLoop]: Abstraction has 1397 states and 1747 transitions. [2023-02-17 08:12:44,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 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:12:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1747 transitions. [2023-02-17 08:12:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-17 08:12:44,458 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:44,458 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:44,472 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 (40)] Forceful destruction successful, exit code 0 [2023-02-17 08:12:44,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:44,670 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1339805073, now seen corresponding path program 1 times [2023-02-17 08:12:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:44,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289287741] [2023-02-17 08:12:44,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:12:44,671 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:12:44,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:44,672 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:44,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-02-17 08:12:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:12:44,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:12:44,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-02-17 08:12:44,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:45,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 65 [2023-02-17 08:12:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-02-17 08:12:45,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:45,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289287741] [2023-02-17 08:12:45,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289287741] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:45,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:45,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-02-17 08:12:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769420564] [2023-02-17 08:12:45,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:45,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 08:12:45,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:45,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 08:12:45,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-02-17 08:12:45,378 INFO L87 Difference]: Start difference. First operand 1397 states and 1747 transitions. Second operand has 20 states, 19 states have (on average 5.631578947368421) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:12:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:55,612 INFO L93 Difference]: Finished difference Result 3650 states and 4614 transitions. [2023-02-17 08:12:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-17 08:12:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.631578947368421) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-17 08:12:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:55,623 INFO L225 Difference]: With dead ends: 3650 [2023-02-17 08:12:55,623 INFO L226 Difference]: Without dead ends: 3650 [2023-02-17 08:12:55,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=452, Invalid=2304, Unknown=0, NotChecked=0, Total=2756 [2023-02-17 08:12:55,624 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 1069 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:55,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 961 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-02-17 08:12:55,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3650 states. [2023-02-17 08:12:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3650 to 2019. [2023-02-17 08:12:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2013 states have (on average 1.282662692498758) internal successors, (2582), 2018 states have internal predecessors, (2582), 0 states have call successors, (0), 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:12:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2582 transitions. [2023-02-17 08:12:55,648 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2582 transitions. Word has length 76 [2023-02-17 08:12:55,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:55,648 INFO L495 AbstractCegarLoop]: Abstraction has 2019 states and 2582 transitions. [2023-02-17 08:12:55,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.631578947368421) internal successors, (107), 20 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:12:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2582 transitions. [2023-02-17 08:12:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-17 08:12:55,650 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:55,650 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:55,665 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 (41)] Ended with exit code 0 [2023-02-17 08:12:55,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:12:55,862 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:12:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:12:55,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1773352908, now seen corresponding path program 3 times [2023-02-17 08:12:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:12:55,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237418966] [2023-02-17 08:12:55,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 08:12:55,863 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:12:55,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:12:55,864 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:12:55,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-17 08:12:56,076 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-17 08:12:56,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 08:12:56,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 08:12:56,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:12:56,092 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:12:56,095 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:12:56,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:12:56,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:12:56,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 55 [2023-02-17 08:12:56,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:12:56,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:12:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-02-17 08:12:56,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:12:57,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:12:57,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:12:57,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 08:12:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2023-02-17 08:12:57,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:12:57,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237418966] [2023-02-17 08:12:57,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237418966] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:12:57,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:12:57,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-02-17 08:12:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626962873] [2023-02-17 08:12:57,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:12:57,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 08:12:57,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:12:57,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 08:12:57,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-02-17 08:12:57,520 INFO L87 Difference]: Start difference. First operand 2019 states and 2582 transitions. Second operand has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 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:12:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:12:59,828 INFO L93 Difference]: Finished difference Result 4155 states and 5339 transitions. [2023-02-17 08:12:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 08:12:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 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 77 [2023-02-17 08:12:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:12:59,838 INFO L225 Difference]: With dead ends: 4155 [2023-02-17 08:12:59,838 INFO L226 Difference]: Without dead ends: 4155 [2023-02-17 08:12:59,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=319, Invalid=737, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 08:12:59,838 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 963 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-17 08:12:59,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 171 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-17 08:12:59,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2023-02-17 08:12:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3787. [2023-02-17 08:12:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3787 states, 3781 states have (on average 1.2853742396191483) internal successors, (4860), 3786 states have internal predecessors, (4860), 0 states have call successors, (0), 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:12:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3787 states and 4860 transitions. [2023-02-17 08:12:59,883 INFO L78 Accepts]: Start accepts. Automaton has 3787 states and 4860 transitions. Word has length 77 [2023-02-17 08:12:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:12:59,883 INFO L495 AbstractCegarLoop]: Abstraction has 3787 states and 4860 transitions. [2023-02-17 08:12:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 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:12:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 4860 transitions. [2023-02-17 08:12:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-17 08:12:59,886 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:12:59,886 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:12:59,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-02-17 08:13:00,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:13:00,089 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2023-02-17 08:13:00,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:13:00,089 INFO L85 PathProgramCache]: Analyzing trace with hash 796230530, now seen corresponding path program 7 times [2023-02-17 08:13:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:13:00,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218431653] [2023-02-17 08:13:00,090 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-17 08:13:00,090 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:00,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:13:00,091 INFO L229 MonitoredProcess]: Starting monitored process 43 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:00,092 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 (43)] Waiting until timeout for monitored process [2023-02-17 08:13:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:13:00,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 08:13:00,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:13:00,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:13:00,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 29 [2023-02-17 08:13:00,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-02-17 08:13:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 155 proven. 144 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-17 08:13:00,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:13:02,001 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 163 proven. 136 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-02-17 08:13:02,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:13:02,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218431653] [2023-02-17 08:13:02,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218431653] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:13:02,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:13:02,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2023-02-17 08:13:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419852660] [2023-02-17 08:13:02,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:13:02,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-17 08:13:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:13:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-17 08:13:02,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 08:13:02,003 INFO L87 Difference]: Start difference. First operand 3787 states and 4860 transitions. Second operand has 38 states, 38 states have (on average 3.0789473684210527) internal successors, (117), 38 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 08:13:08,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:09,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:10,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:11,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:13,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:15,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:17,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:20,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:24,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:28,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:31,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:32,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:35,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:37,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:38,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:40,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:51,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:53,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:56,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:13:58,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:14:00,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:14:03,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:14:04,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:14:06,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:14:08,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-17 08:14:11,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []