./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20020406-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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 00:57:23,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 00:57:23,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 00:57:23,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 00:57:23,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 00:57:23,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 00:57:23,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 00:57:23,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 00:57:23,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 00:57:23,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 00:57:23,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 00:57:23,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 00:57:23,710 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 00:57:23,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 00:57:23,712 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 00:57:23,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 00:57:23,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 00:57:23,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 00:57:23,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 00:57:23,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 00:57:23,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 00:57:23,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 00:57:23,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 00:57:23,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 00:57:23,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 00:57:23,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 00:57:23,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 00:57:23,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 00:57:23,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 00:57:23,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 00:57:23,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 00:57:23,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 00:57:23,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 00:57:23,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 00:57:23,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 00:57:23,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 00:57:23,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 00:57:23,734 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 00:57:23,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 00:57:23,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 00:57:23,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 00:57:23,736 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 00:57:23,764 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 00:57:23,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 00:57:23,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 00:57:23,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 00:57:23,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 00:57:23,765 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 00:57:23,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 00:57:23,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 00:57:23,766 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 00:57:23,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 00:57:23,767 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 00:57:23,767 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 00:57:23,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 00:57:23,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 00:57:23,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 00:57:23,768 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 00:57:23,768 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 00:57:23,768 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 00:57:23,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 00:57:23,768 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 00:57:23,768 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 00:57:23,769 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 00:57:23,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 00:57:23,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 00:57:23,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 00:57:23,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:57:23,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 00:57:23,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 00:57:23,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 00:57:23,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 00:57:23,770 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 00:57:23,770 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 00:57:23,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 00:57:23,771 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 00:57:23,771 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2023-02-15 00:57:23,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 00:57:23,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 00:57:23,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 00:57:23,989 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 00:57:23,989 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 00:57:23,990 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 00:57:25,079 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 00:57:25,309 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 00:57:25,311 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 00:57:25,324 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32247d54e/4b7f00d02c704eb79e3cb3f31a0c7d3a/FLAG4f2ea0424 [2023-02-15 00:57:25,335 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32247d54e/4b7f00d02c704eb79e3cb3f31a0c7d3a [2023-02-15 00:57:25,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 00:57:25,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 00:57:25,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 00:57:25,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 00:57:25,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 00:57:25,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:57:25" (1/1) ... [2023-02-15 00:57:25,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297d41eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:25, skipping insertion in model container [2023-02-15 00:57:25,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:57:25" (1/1) ... [2023-02-15 00:57:25,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 00:57:25,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:57:25,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:57:25,757 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-15 00:57:25,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@27f10d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:25, skipping insertion in model container [2023-02-15 00:57:25,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 00:57:25,757 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 00:57:25,759 INFO L158 Benchmark]: Toolchain (without parser) took 420.74ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 84.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 00:57:25,759 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:57:25,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.37ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 84.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 00:57:25,760 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.14ms. Allocated memory is still 142.6MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.37ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 84.8MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 897]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20020406-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 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 00:57:27,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 00:57:27,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 00:57:27,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 00:57:27,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 00:57:27,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 00:57:27,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 00:57:27,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 00:57:27,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 00:57:27,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 00:57:27,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 00:57:27,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 00:57:27,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 00:57:27,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 00:57:27,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 00:57:27,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 00:57:27,506 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 00:57:27,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 00:57:27,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 00:57:27,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 00:57:27,511 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 00:57:27,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 00:57:27,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 00:57:27,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 00:57:27,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 00:57:27,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 00:57:27,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 00:57:27,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 00:57:27,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 00:57:27,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 00:57:27,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 00:57:27,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 00:57:27,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 00:57:27,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 00:57:27,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 00:57:27,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 00:57:27,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 00:57:27,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 00:57:27,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 00:57:27,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 00:57:27,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 00:57:27,532 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 00:57:27,564 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 00:57:27,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 00:57:27,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 00:57:27,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 00:57:27,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 00:57:27,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 00:57:27,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 00:57:27,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 00:57:27,567 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 00:57:27,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 00:57:27,568 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 00:57:27,568 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 00:57:27,568 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 00:57:27,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 00:57:27,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 00:57:27,568 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 00:57:27,568 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 00:57:27,569 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 00:57:27,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 00:57:27,569 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 00:57:27,569 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 00:57:27,569 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 00:57:27,569 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 00:57:27,569 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 00:57:27,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 00:57:27,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 00:57:27,570 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 00:57:27,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:57:27,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 00:57:27,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 00:57:27,571 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 00:57:27,571 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 00:57:27,571 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 00:57:27,571 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 00:57:27,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 00:57:27,572 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 00:57:27,572 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 00:57:27,572 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 -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2023-02-15 00:57:27,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 00:57:27,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 00:57:27,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 00:57:27,873 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 00:57:27,874 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 00:57:27,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 00:57:28,932 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 00:57:29,126 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 00:57:29,127 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 00:57:29,167 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78654cf0/bb0689b680564c56955c2035aa580015/FLAG19aef6439 [2023-02-15 00:57:29,179 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b78654cf0/bb0689b680564c56955c2035aa580015 [2023-02-15 00:57:29,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 00:57:29,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 00:57:29,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 00:57:29,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 00:57:29,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 00:57:29,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793c5b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29, skipping insertion in model container [2023-02-15 00:57:29,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,207 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 00:57:29,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:57:29,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:57:29,633 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 00:57:29,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:57:29,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:57:29,691 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 00:57:29,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:57:29,787 INFO L208 MainTranslator]: Completed translation [2023-02-15 00:57:29,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29 WrapperNode [2023-02-15 00:57:29,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 00:57:29,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 00:57:29,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 00:57:29,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 00:57:29,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,870 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-02-15 00:57:29,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 00:57:29,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 00:57:29,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 00:57:29,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 00:57:29,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,916 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 00:57:29,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 00:57:29,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 00:57:29,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 00:57:29,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (1/1) ... [2023-02-15 00:57:29,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:57:29,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:57:29,973 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-15 00:57:29,988 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-15 00:57:30,002 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2023-02-15 00:57:30,003 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2023-02-15 00:57:30,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 00:57:30,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 00:57:30,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 00:57:30,003 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2023-02-15 00:57:30,003 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2023-02-15 00:57:30,003 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2023-02-15 00:57:30,003 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2023-02-15 00:57:30,003 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2023-02-15 00:57:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2023-02-15 00:57:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 00:57:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 00:57:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 00:57:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2023-02-15 00:57:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2023-02-15 00:57:30,004 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2023-02-15 00:57:30,004 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2023-02-15 00:57:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 00:57:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 00:57:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 00:57:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2023-02-15 00:57:30,005 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2023-02-15 00:57:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2023-02-15 00:57:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2023-02-15 00:57:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 00:57:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 00:57:30,160 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 00:57:30,161 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 00:57:30,808 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 00:57:30,815 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 00:57:30,816 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 00:57:30,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:57:30 BoogieIcfgContainer [2023-02-15 00:57:30,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 00:57:30,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 00:57:30,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 00:57:30,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 00:57:30,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:57:29" (1/3) ... [2023-02-15 00:57:30,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30870857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:57:30, skipping insertion in model container [2023-02-15 00:57:30,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:57:29" (2/3) ... [2023-02-15 00:57:30,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30870857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:57:30, skipping insertion in model container [2023-02-15 00:57:30,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:57:30" (3/3) ... [2023-02-15 00:57:30,824 INFO L112 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2023-02-15 00:57:30,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 00:57:30,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2023-02-15 00:57:30,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 00:57:30,882 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;@39c01430, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 00:57:30,882 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2023-02-15 00:57:30,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:57:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 00:57:30,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:30,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 00:57:30,892 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 228226931, now seen corresponding path program 1 times [2023-02-15 00:57:30,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:30,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665992891] [2023-02-15 00:57:30,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:30,906 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-15 00:57:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:30,935 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-15 00:57:30,965 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-15 00:57:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:31,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 00:57:31,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:31,068 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 7 [2023-02-15 00:57:31,081 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-15 00:57:31,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:31,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:31,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665992891] [2023-02-15 00:57:31,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665992891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:31,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:31,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 00:57:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413370884] [2023-02-15 00:57:31,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:31,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:57:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:31,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:57:31,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:31,122 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:31,372 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2023-02-15 00:57:31,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:57:31,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 00:57:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:31,384 INFO L225 Difference]: With dead ends: 182 [2023-02-15 00:57:31,385 INFO L226 Difference]: Without dead ends: 180 [2023-02-15 00:57:31,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:31,390 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:31,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 344 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:57:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-15 00:57:31,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-02-15 00:57:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:57:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2023-02-15 00:57:31,451 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2023-02-15 00:57:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:31,451 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2023-02-15 00:57:31,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2023-02-15 00:57:31,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 00:57:31,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:31,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 00:57:31,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 00:57:31,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-15 00:57:31,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 228226932, now seen corresponding path program 1 times [2023-02-15 00:57:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:31,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811369212] [2023-02-15 00:57:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:31,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-15 00:57:31,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:31,699 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-15 00:57:31,701 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-15 00:57:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:31,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 00:57:31,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:31,792 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-15 00:57:31,798 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-15 00:57:31,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:31,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:31,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811369212] [2023-02-15 00:57:31,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811369212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:31,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:31,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 00:57:31,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847830334] [2023-02-15 00:57:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:31,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:57:31,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:31,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:57:31,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:31,802 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:32,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:32,008 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2023-02-15 00:57:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:57:32,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 00:57:32,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:32,011 INFO L225 Difference]: With dead ends: 184 [2023-02-15 00:57:32,011 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 00:57:32,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:32,012 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:32,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:57:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 00:57:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2023-02-15 00:57:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:57:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2023-02-15 00:57:32,028 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2023-02-15 00:57:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:32,029 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2023-02-15 00:57:32,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2023-02-15 00:57:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 00:57:32,029 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:32,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:32,036 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-15 00:57:32,236 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-15 00:57:32,236 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:32,237 INFO L85 PathProgramCache]: Analyzing trace with hash 282747829, now seen corresponding path program 1 times [2023-02-15 00:57:32,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:32,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798315942] [2023-02-15 00:57:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:32,240 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-15 00:57:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:32,241 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-15 00:57:32,276 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-15 00:57:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:32,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 00:57:32,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:32,313 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-15 00:57:32,317 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 7 [2023-02-15 00:57:32,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:57:32,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 00:57:32,347 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 00:57:32,348 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 13 treesize of output 13 [2023-02-15 00:57:32,358 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-15 00:57:32,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:32,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:32,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798315942] [2023-02-15 00:57:32,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798315942] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:32,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:32,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 00:57:32,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989985176] [2023-02-15 00:57:32,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 00:57:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:32,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 00:57:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:57:32,360 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:32,553 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2023-02-15 00:57:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:57:32,554 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 00:57:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:32,555 INFO L225 Difference]: With dead ends: 177 [2023-02-15 00:57:32,555 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 00:57:32,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:57:32,556 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 32 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:32,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 342 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:57:32,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 00:57:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2023-02-15 00:57:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:57:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2023-02-15 00:57:32,562 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2023-02-15 00:57:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:32,562 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2023-02-15 00:57:32,562 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2023-02-15 00:57:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 00:57:32,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:32,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:32,589 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-15 00:57:32,792 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-15 00:57:32,793 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:32,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:32,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1865414411, now seen corresponding path program 1 times [2023-02-15 00:57:32,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:32,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730599400] [2023-02-15 00:57:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:32,805 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-15 00:57:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:32,807 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-15 00:57:32,813 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-15 00:57:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:32,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 00:57:32,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:32,878 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 7 [2023-02-15 00:57:32,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:57:32,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 00:57:32,914 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-15 00:57:32,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:32,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:32,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730599400] [2023-02-15 00:57:32,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730599400] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:32,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:32,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 00:57:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154836239] [2023-02-15 00:57:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:32,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 00:57:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 00:57:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:57:32,916 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:33,394 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2023-02-15 00:57:33,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 00:57:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 00:57:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:33,396 INFO L225 Difference]: With dead ends: 186 [2023-02-15 00:57:33,396 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 00:57:33,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-15 00:57:33,397 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:33,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 811 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 00:57:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 00:57:33,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2023-02-15 00:57:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:57:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2023-02-15 00:57:33,404 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2023-02-15 00:57:33,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:33,405 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2023-02-15 00:57:33,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:33,405 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2023-02-15 00:57:33,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 00:57:33,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:33,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:33,412 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-15 00:57:33,611 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-15 00:57:33,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:33,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1993271845, now seen corresponding path program 1 times [2023-02-15 00:57:33,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:33,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192889954] [2023-02-15 00:57:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:33,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-15 00:57:33,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:33,615 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-15 00:57:33,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 (6)] Waiting until timeout for monitored process [2023-02-15 00:57:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:33,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 00:57:33,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:33,705 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 10 treesize of output 9 [2023-02-15 00:57:33,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:57:33,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:57:33,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 00:57:33,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 00:57:33,814 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-15 00:57:33,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:33,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:33,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192889954] [2023-02-15 00:57:33,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192889954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:33,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:33,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 00:57:33,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066415141] [2023-02-15 00:57:33,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:33,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 00:57:33,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 00:57:33,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:57:33,815 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:34,481 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2023-02-15 00:57:34,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 00:57:34,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 00:57:34,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:34,483 INFO L225 Difference]: With dead ends: 197 [2023-02-15 00:57:34,483 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 00:57:34,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-02-15 00:57:34,483 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 62 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:34,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1053 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 00:57:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 00:57:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2023-02-15 00:57:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:57:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2023-02-15 00:57:34,490 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2023-02-15 00:57:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:34,490 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2023-02-15 00:57:34,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2023-02-15 00:57:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 00:57:34,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:34,491 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] [2023-02-15 00:57:34,510 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 (6)] Ended with exit code 0 [2023-02-15 00:57:34,691 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-15 00:57:34,692 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:34,692 INFO L85 PathProgramCache]: Analyzing trace with hash 335042805, now seen corresponding path program 1 times [2023-02-15 00:57:34,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:34,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441665866] [2023-02-15 00:57:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:34,693 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-15 00:57:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:34,694 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-15 00:57:34,696 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-15 00:57:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:34,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 00:57:34,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:34,835 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-15 00:57:34,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:34,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:34,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441665866] [2023-02-15 00:57:34,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441665866] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:34,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:34,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 00:57:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836314331] [2023-02-15 00:57:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:34,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 00:57:34,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 00:57:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:57:34,838 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:57:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:34,986 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2023-02-15 00:57:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:57:34,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-15 00:57:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:34,988 INFO L225 Difference]: With dead ends: 209 [2023-02-15 00:57:34,988 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 00:57:34,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-15 00:57:34,989 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 44 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:34,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 757 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:57:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 00:57:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2023-02-15 00:57:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 156 states have internal predecessors, (164), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-15 00:57:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2023-02-15 00:57:34,995 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 21 [2023-02-15 00:57:34,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:34,996 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2023-02-15 00:57:34,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:57:34,996 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2023-02-15 00:57:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 00:57:34,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:34,997 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] [2023-02-15 00:57:35,011 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-15 00:57:35,211 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-15 00:57:35,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:35,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:35,212 INFO L85 PathProgramCache]: Analyzing trace with hash 370721495, now seen corresponding path program 1 times [2023-02-15 00:57:35,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:35,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034863642] [2023-02-15 00:57:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:35,213 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-15 00:57:35,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:35,214 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-15 00:57:35,217 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-15 00:57:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:35,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 00:57:35,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:35,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:57:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:35,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034863642] [2023-02-15 00:57:35,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034863642] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:57:35,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:57:35,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-15 00:57:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926188684] [2023-02-15 00:57:35,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:57:35,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 00:57:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:35,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 00:57:35,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-15 00:57:35,548 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:57:36,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:36,006 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2023-02-15 00:57:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 00:57:36,008 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 00:57:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:36,009 INFO L225 Difference]: With dead ends: 246 [2023-02-15 00:57:36,009 INFO L226 Difference]: Without dead ends: 234 [2023-02-15 00:57:36,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2023-02-15 00:57:36,010 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 123 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:36,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1351 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 00:57:36,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-15 00:57:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2023-02-15 00:57:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 127 states have (on average 1.4960629921259843) internal successors, (190), 173 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-15 00:57:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2023-02-15 00:57:36,015 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 22 [2023-02-15 00:57:36,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:36,016 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2023-02-15 00:57:36,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:57:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2023-02-15 00:57:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 00:57:36,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:36,016 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:36,039 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 (8)] Ended with exit code 0 [2023-02-15 00:57:36,227 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-15 00:57:36,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash -843792011, now seen corresponding path program 2 times [2023-02-15 00:57:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:36,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852267421] [2023-02-15 00:57:36,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:57:36,229 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-15 00:57:36,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:36,230 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-15 00:57:36,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 00:57:36,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 00:57:36,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:57:36,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 00:57:36,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 00:57:36,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:36,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:36,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852267421] [2023-02-15 00:57:36,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852267421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:36,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:36,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 00:57:36,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880879436] [2023-02-15 00:57:36,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:36,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 00:57:36,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 00:57:36,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:57:36,369 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:57:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:36,692 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2023-02-15 00:57:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:57:36,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-02-15 00:57:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:36,694 INFO L225 Difference]: With dead ends: 214 [2023-02-15 00:57:36,694 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 00:57:36,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 00:57:36,695 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:36,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 756 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 00:57:36,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 00:57:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-02-15 00:57:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-15 00:57:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2023-02-15 00:57:36,700 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 25 [2023-02-15 00:57:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:36,700 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2023-02-15 00:57:36,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:57:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2023-02-15 00:57:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 00:57:36,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:36,700 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:36,712 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-15 00:57:36,912 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-15 00:57:36,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:36,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash -843792010, now seen corresponding path program 1 times [2023-02-15 00:57:36,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:36,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029126770] [2023-02-15 00:57:36,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:36,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:36,915 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-15 00:57:36,925 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-15 00:57:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:37,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 00:57:37,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:37,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:57:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:37,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:37,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029126770] [2023-02-15 00:57:37,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029126770] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:57:37,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:57:37,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-15 00:57:37,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972147830] [2023-02-15 00:57:37,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:57:37,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 00:57:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:37,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 00:57:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-02-15 00:57:37,456 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:57:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:38,551 INFO L93 Difference]: Finished difference Result 285 states and 358 transitions. [2023-02-15 00:57:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 00:57:38,554 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-15 00:57:38,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:38,555 INFO L225 Difference]: With dead ends: 285 [2023-02-15 00:57:38,555 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 00:57:38,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 00:57:38,556 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 165 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:38,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1817 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 00:57:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 00:57:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 222. [2023-02-15 00:57:38,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 179 states have internal predecessors, (193), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 00:57:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2023-02-15 00:57:38,562 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 25 [2023-02-15 00:57:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:38,563 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2023-02-15 00:57:38,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:57:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2023-02-15 00:57:38,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 00:57:38,566 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:38,566 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:38,574 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 (10)] Ended with exit code 0 [2023-02-15 00:57:38,773 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-15 00:57:38,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash 168356342, now seen corresponding path program 2 times [2023-02-15 00:57:38,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:38,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228797710] [2023-02-15 00:57:38,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:57:38,775 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-15 00:57:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:38,776 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-15 00:57:38,778 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-15 00:57:38,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 00:57:38,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:57:38,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 00:57:38,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 00:57:39,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:39,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:39,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228797710] [2023-02-15 00:57:39,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228797710] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:39,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:39,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 00:57:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056034429] [2023-02-15 00:57:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:39,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 00:57:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 00:57:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 00:57:39,020 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:57:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:39,485 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2023-02-15 00:57:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 00:57:39,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-02-15 00:57:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:39,486 INFO L225 Difference]: With dead ends: 220 [2023-02-15 00:57:39,486 INFO L226 Difference]: Without dead ends: 220 [2023-02-15 00:57:39,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:57:39,487 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 15 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:39,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 809 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 00:57:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-15 00:57:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2023-02-15 00:57:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 177 states have internal predecessors, (191), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 00:57:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2023-02-15 00:57:39,492 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 29 [2023-02-15 00:57:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:39,492 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2023-02-15 00:57:39,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:57:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2023-02-15 00:57:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 00:57:39,493 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:39,493 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:39,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-02-15 00:57:39,693 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-15 00:57:39,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash 924079462, now seen corresponding path program 1 times [2023-02-15 00:57:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:39,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410164467] [2023-02-15 00:57:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:39,694 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-15 00:57:39,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:39,699 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-15 00:57:39,700 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-15 00:57:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:39,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 00:57:39,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:39,904 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 7 [2023-02-15 00:57:39,927 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 00:57:39,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 00:57:39,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:57:40,037 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:57:40,075 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:57:40,092 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:57:40,108 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:57:40,127 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:57:40,146 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:57:40,164 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:57:40,184 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:40,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 00:57:40,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-02-15 00:57:40,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 00:57:40,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-02-15 00:57:40,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 00:57:40,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:57:42,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1)))) is different from false [2023-02-15 00:57:42,072 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-02-15 00:57:42,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-02-15 00:57:42,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 00:57:42,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-15 00:57:42,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-02-15 00:57:42,094 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 11 treesize of output 7 [2023-02-15 00:57:46,177 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 8 not checked. [2023-02-15 00:57:46,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:46,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410164467] [2023-02-15 00:57:46,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410164467] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:57:46,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:57:46,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 00:57:46,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335056996] [2023-02-15 00:57:46,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:57:46,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 00:57:46,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:46,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 00:57:46,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=256, Unknown=4, NotChecked=102, Total=420 [2023-02-15 00:57:46,178 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:57:47,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:47,477 INFO L93 Difference]: Finished difference Result 219 states and 265 transitions. [2023-02-15 00:57:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 00:57:47,478 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 00:57:47,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:47,479 INFO L225 Difference]: With dead ends: 219 [2023-02-15 00:57:47,479 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 00:57:47,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=99, Invalid=415, Unknown=4, NotChecked=132, Total=650 [2023-02-15 00:57:47,480 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 25 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:47,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2130 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 760 Invalid, 0 Unknown, 215 Unchecked, 1.1s Time] [2023-02-15 00:57:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 00:57:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-02-15 00:57:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 176 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 00:57:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 265 transitions. [2023-02-15 00:57:47,485 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 265 transitions. Word has length 30 [2023-02-15 00:57:47,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:47,486 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 265 transitions. [2023-02-15 00:57:47,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:57:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 265 transitions. [2023-02-15 00:57:47,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 00:57:47,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:47,487 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:47,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-02-15 00:57:47,695 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-15 00:57:47,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:57:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 924079463, now seen corresponding path program 1 times [2023-02-15 00:57:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985560840] [2023-02-15 00:57:47,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:47,697 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-15 00:57:47,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:47,698 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-15 00:57:47,700 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-15 00:57:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:47,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 00:57:47,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:47,932 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 7 [2023-02-15 00:57:47,946 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 10 treesize of output 9 [2023-02-15 00:57:47,958 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 00:57:47,959 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 13 treesize of output 13 [2023-02-15 00:57:47,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:57:47,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:57:48,114 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:57:48,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:57:48,121 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 7 treesize of output 3 [2023-02-15 00:57:48,136 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:57:48,171 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:57:48,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:57:48,185 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 16 treesize of output 18 [2023-02-15 00:57:48,215 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:57:48,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:57:48,229 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 16 treesize of output 18 [2023-02-15 00:57:48,254 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:57:48,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:57:48,283 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 16 treesize of output 18 [2023-02-15 00:57:48,306 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:57:48,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:57:48,312 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 7 treesize of output 3 [2023-02-15 00:57:48,335 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:57:48,393 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:57:48,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:57:48,405 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 16 treesize of output 18 [2023-02-15 00:57:48,424 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:57:48,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:57:48,449 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 16 treesize of output 18 [2023-02-15 00:57:48,467 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:57:48,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-02-15 00:57:48,475 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 22 treesize of output 24 [2023-02-15 00:57:48,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 00:57:48,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 00:57:48,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-15 00:57:48,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2023-02-15 00:57:48,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-15 00:57:48,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 00:57:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 00:57:48,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:58:20,033 WARN L233 SmtUtils]: Spent 31.18s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-15 00:58:27,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 00:58:27,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-02-15 00:58:27,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-02-15 00:58:27,295 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 00:58:27,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 00:58:27,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 00:58:27,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-15 00:58:27,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 00:58:27,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 00:58:27,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 00:58:27,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 00:58:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 00:58:27,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:27,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985560840] [2023-02-15 00:58:27,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985560840] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:58:27,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:58:27,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 00:58:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667719202] [2023-02-15 00:58:27,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:58:27,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 00:58:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:27,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 00:58:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=361, Unknown=4, NotChecked=0, Total=420 [2023-02-15 00:58:27,517 INFO L87 Difference]: Start difference. First operand 219 states and 265 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:58:35,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 00:58:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:40,152 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2023-02-15 00:58:40,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 00:58:40,153 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 00:58:40,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:40,175 INFO L225 Difference]: With dead ends: 218 [2023-02-15 00:58:40,175 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 00:58:40,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=169, Invalid=883, Unknown=4, NotChecked=0, Total=1056 [2023-02-15 00:58:40,177 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 40 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 17 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2225 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:40,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2225 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1076 Invalid, 8 Unknown, 0 Unchecked, 7.8s Time] [2023-02-15 00:58:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 00:58:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-15 00:58:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 175 states have internal predecessors, (189), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 00:58:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2023-02-15 00:58:40,188 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 30 [2023-02-15 00:58:40,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:40,189 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2023-02-15 00:58:40,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:58:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2023-02-15 00:58:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 00:58:40,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:40,194 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:40,206 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-15 00:58:40,403 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-15 00:58:40,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:58:40,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:40,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2092985884, now seen corresponding path program 1 times [2023-02-15 00:58:40,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:40,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248506134] [2023-02-15 00:58:40,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:58:40,405 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-15 00:58:40,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:40,407 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-15 00:58:40,409 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-15 00:58:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:58:40,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 00:58:40,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:40,637 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 10 treesize of output 9 [2023-02-15 00:58:40,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:58:40,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:58:40,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 00:58:40,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 00:58:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 00:58:40,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:58:40,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:40,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248506134] [2023-02-15 00:58:40,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248506134] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:58:40,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:58:40,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 00:58:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540689903] [2023-02-15 00:58:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:58:40,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 00:58:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:40,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 00:58:40,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:58:40,755 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:58:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:41,304 INFO L93 Difference]: Finished difference Result 230 states and 271 transitions. [2023-02-15 00:58:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 00:58:41,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-02-15 00:58:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:41,305 INFO L225 Difference]: With dead ends: 230 [2023-02-15 00:58:41,305 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 00:58:41,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-02-15 00:58:41,306 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 62 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:41,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 902 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 00:58:41,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 00:58:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2023-02-15 00:58:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.376923076923077) internal successors, (179), 170 states have internal predecessors, (179), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:58:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2023-02-15 00:58:41,311 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 42 [2023-02-15 00:58:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:41,311 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2023-02-15 00:58:41,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 00:58:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2023-02-15 00:58:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 00:58:41,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:41,311 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:41,321 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-15 00:58:41,520 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-15 00:58:41,520 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:58:41,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -562772518, now seen corresponding path program 1 times [2023-02-15 00:58:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:41,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153280841] [2023-02-15 00:58:41,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:58:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:58:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:41,522 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-15 00:58:41,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 00:58:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:58:41,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 00:58:41,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-15 00:58:41,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:58:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-15 00:58:42,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:42,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153280841] [2023-02-15 00:58:42,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153280841] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:58:42,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:58:42,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 00:58:42,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986967570] [2023-02-15 00:58:42,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:58:42,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 00:58:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:42,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 00:58:42,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-02-15 00:58:42,354 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 00:58:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:44,301 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2023-02-15 00:58:44,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 00:58:44,302 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2023-02-15 00:58:44,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:44,303 INFO L225 Difference]: With dead ends: 291 [2023-02-15 00:58:44,303 INFO L226 Difference]: Without dead ends: 279 [2023-02-15 00:58:44,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=641, Invalid=1521, Unknown=0, NotChecked=0, Total=2162 [2023-02-15 00:58:44,304 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 180 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 2371 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:44,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 2371 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 00:58:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-02-15 00:58:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 220. [2023-02-15 00:58:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 177 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:58:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2023-02-15 00:58:44,311 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 56 [2023-02-15 00:58:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:44,311 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2023-02-15 00:58:44,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 00:58:44,312 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2023-02-15 00:58:44,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 00:58:44,312 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:44,312 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:44,324 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-15 00:58:44,523 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-15 00:58:44,523 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:58:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093162, now seen corresponding path program 2 times [2023-02-15 00:58:44,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:44,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1901341371] [2023-02-15 00:58:44,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:58:44,524 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-15 00:58:44,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:44,525 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-15 00:58:44,534 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-15 00:58:44,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 00:58:44,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:58:44,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 00:58:44,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-02-15 00:58:44,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:58:44,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:44,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1901341371] [2023-02-15 00:58:44,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1901341371] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:58:44,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:58:44,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 00:58:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671031715] [2023-02-15 00:58:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:58:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 00:58:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:44,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 00:58:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:58:44,736 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:58:45,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:45,173 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2023-02-15 00:58:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:58:45,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-02-15 00:58:45,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:45,175 INFO L225 Difference]: With dead ends: 218 [2023-02-15 00:58:45,175 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 00:58:45,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 00:58:45,176 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 23 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:45,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 00:58:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 00:58:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-15 00:58:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 175 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:58:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2023-02-15 00:58:45,203 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 63 [2023-02-15 00:58:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:45,204 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2023-02-15 00:58:45,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:58:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2023-02-15 00:58:45,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 00:58:45,205 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:45,205 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:45,231 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-15 00:58:45,414 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-15 00:58:45,414 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:58:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093161, now seen corresponding path program 1 times [2023-02-15 00:58:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:45,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938968109] [2023-02-15 00:58:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:58:45,416 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-15 00:58:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:45,417 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-15 00:58:45,420 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-15 00:58:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:58:45,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 00:58:45,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-02-15 00:58:45,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:58:45,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:45,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938968109] [2023-02-15 00:58:45,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938968109] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:58:45,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:58:45,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 00:58:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384712237] [2023-02-15 00:58:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:58:45,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 00:58:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:45,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 00:58:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 00:58:45,957 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:58:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:46,429 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2023-02-15 00:58:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 00:58:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-02-15 00:58:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:46,431 INFO L225 Difference]: With dead ends: 216 [2023-02-15 00:58:46,431 INFO L226 Difference]: Without dead ends: 216 [2023-02-15 00:58:46,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:58:46,432 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 16 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:46,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 787 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 00:58:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-15 00:58:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2023-02-15 00:58:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 173 states have internal predecessors, (182), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:58:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2023-02-15 00:58:46,437 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 63 [2023-02-15 00:58:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:46,437 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2023-02-15 00:58:46,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 00:58:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2023-02-15 00:58:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 00:58:46,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:46,438 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:46,448 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-15 00:58:46,642 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-15 00:58:46,642 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:58:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash -585378383, now seen corresponding path program 1 times [2023-02-15 00:58:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:46,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700769091] [2023-02-15 00:58:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:58:46,643 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-15 00:58:46,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:46,644 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-15 00:58:46,646 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-15 00:58:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:58:47,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 00:58:47,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:47,394 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 7 [2023-02-15 00:58:47,438 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 00:58:47,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 00:58:47,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:58:47,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,626 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,662 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,687 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,722 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,789 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,827 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,883 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,909 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 00:58:47,945 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:47,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 00:58:47,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:47,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:47,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:47,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:47,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-02-15 00:58:47,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 00:58:48,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 00:58:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-15 00:58:48,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:58:50,265 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (_ bv1 1)))) is different from false [2023-02-15 00:58:52,400 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-02-15 00:58:52,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 00:58:52,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-15 00:58:52,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-02-15 00:58:52,419 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 11 treesize of output 7 [2023-02-15 00:58:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 12 not checked. [2023-02-15 00:58:54,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:54,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700769091] [2023-02-15 00:58:54,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700769091] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:58:54,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:58:54,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 00:58:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58255474] [2023-02-15 00:58:54,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:58:54,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 00:58:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 00:58:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=288, Unknown=3, NotChecked=70, Total=420 [2023-02-15 00:58:54,536 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 00:58:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:56,383 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2023-02-15 00:58:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 00:58:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-15 00:58:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:56,385 INFO L225 Difference]: With dead ends: 220 [2023-02-15 00:58:56,385 INFO L226 Difference]: Without dead ends: 220 [2023-02-15 00:58:56,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=102, Invalid=455, Unknown=3, NotChecked=90, Total=650 [2023-02-15 00:58:56,385 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 37 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:56,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1946 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 707 Invalid, 0 Unknown, 136 Unchecked, 1.6s Time] [2023-02-15 00:58:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-15 00:58:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2023-02-15 00:58:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 172 states have internal predecessors, (181), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 00:58:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions. [2023-02-15 00:58:56,390 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 64 [2023-02-15 00:58:56,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:56,390 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions. [2023-02-15 00:58:56,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 00:58:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions. [2023-02-15 00:58:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 00:58:56,391 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:56,391 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:56,418 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-15 00:58:56,591 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-15 00:58:56,592 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 00:58:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -585378382, now seen corresponding path program 1 times [2023-02-15 00:58:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194208077] [2023-02-15 00:58:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:58:56,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:58:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:56,595 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-15 00:58:56,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 00:58:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:58:57,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 00:58:57,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:57,334 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 7 [2023-02-15 00:58:57,358 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 10 treesize of output 9 [2023-02-15 00:58:57,374 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 00:58:57,374 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 13 treesize of output 13 [2023-02-15 00:58:57,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:58:57,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 00:58:57,624 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:57,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:57,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:57,642 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 16 treesize of output 18 [2023-02-15 00:58:57,673 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:58:57,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:58:57,682 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 7 treesize of output 3 [2023-02-15 00:58:57,707 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:57,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:57,768 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:57,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:57,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:57,788 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 16 treesize of output 18 [2023-02-15 00:58:57,811 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:58:57,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:58:57,818 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 7 treesize of output 3 [2023-02-15 00:58:57,844 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:57,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:57,906 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:57,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:57,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:57,924 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 16 treesize of output 18 [2023-02-15 00:58:57,951 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:58:57,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:58:57,959 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 7 treesize of output 3 [2023-02-15 00:58:57,980 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:57,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:58,026 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:58:58,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:58:58,032 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 7 treesize of output 3 [2023-02-15 00:58:58,051 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:58,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:58,094 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:58,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:58,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,115 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 16 treesize of output 18 [2023-02-15 00:58:58,138 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:58:58,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:58:58,142 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 7 treesize of output 3 [2023-02-15 00:58:58,161 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:58,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:58,208 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 00:58:58,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 00:58:58,214 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 7 treesize of output 3 [2023-02-15 00:58:58,226 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:58,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:58,261 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:58,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 00:58:58,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,275 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 16 treesize of output 18 [2023-02-15 00:58:58,327 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 00:58:58,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-02-15 00:58:58,348 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 22 treesize of output 24 [2023-02-15 00:58:58,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 00:58:58,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 00:58:58,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 00:58:58,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-15 00:58:58,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2023-02-15 00:58:58,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 00:58:58,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 00:58:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-15 00:58:58,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:59:56,629 WARN L233 SmtUtils]: Spent 57.83s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-15 01:00:05,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:00:05,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-02-15 01:00:05,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-02-15 01:00:05,478 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 15 treesize of output 7 [2023-02-15 01:00:05,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:00:05,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 01:00:05,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:00:05,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-15 01:00:05,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:00:05,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 01:00:05,518 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:00:05,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 01:00:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-15 01:00:05,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:00:05,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194208077] [2023-02-15 01:00:05,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194208077] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:00:05,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:00:05,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 01:00:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327824439] [2023-02-15 01:00:05,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:00:05,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 01:00:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:00:05,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 01:00:05,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=362, Unknown=3, NotChecked=0, Total=420 [2023-02-15 01:00:05,829 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:00:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:18,196 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2023-02-15 01:00:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 01:00:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-15 01:00:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:18,200 INFO L225 Difference]: With dead ends: 219 [2023-02-15 01:00:18,200 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 01:00:18,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=169, Invalid=884, Unknown=3, NotChecked=0, Total=1056 [2023-02-15 01:00:18,200 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 47 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1061 mSolverCounterSat, 19 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 2308 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1061 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:18,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 2308 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1061 Invalid, 9 Unknown, 0 Unchecked, 6.7s Time] [2023-02-15 01:00:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 01:00:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2023-02-15 01:00:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.313868613138686) internal successors, (180), 171 states have internal predecessors, (180), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 01:00:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2023-02-15 01:00:18,217 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 64 [2023-02-15 01:00:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:18,217 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2023-02-15 01:00:18,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 01:00:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2023-02-15 01:00:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 01:00:18,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:18,218 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:18,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-02-15 01:00:18,423 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-15 01:00:18,424 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 01:00:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741073, now seen corresponding path program 1 times [2023-02-15 01:00:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:00:18,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451532633] [2023-02-15 01:00:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:00:18,425 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-15 01:00:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:00:18,428 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-15 01:00:18,431 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-15 01:00:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:00:19,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 01:00:19,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:00:19,115 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 7 [2023-02-15 01:00:19,212 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649))) is different from true [2023-02-15 01:00:19,222 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~malloc33#1.base| (_ bv1 1)))) is different from true [2023-02-15 01:00:19,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:00:19,236 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) (bvadd (_ bv8 32) |c_DUPFFnew_~ans~0#1.offset|)) (_ bv1 1)) |c_#valid|)) is different from true [2023-02-15 01:00:19,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:00:19,249 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~mem34#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-15 01:00:19,253 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (v_ArrVal_2649 (_ BitVec 1))) (= (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-15 01:00:19,360 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:00:19,382 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-15 01:00:19,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 31 [2023-02-15 01:00:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 123 not checked. [2023-02-15 01:00:19,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:00:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-02-15 01:00:19,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:00:19,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451532633] [2023-02-15 01:00:19,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451532633] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:00:19,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:00:19,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 19 [2023-02-15 01:00:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540070547] [2023-02-15 01:00:19,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:00:19,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 01:00:19,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:00:19,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 01:00:19,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=179, Unknown=5, NotChecked=150, Total=380 [2023-02-15 01:00:19,968 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:00:26,001 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, 1] [2023-02-15 01:00:28,003 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, 1] [2023-02-15 01:00:30,006 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, 1] [2023-02-15 01:00:32,010 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, 1] [2023-02-15 01:00:34,012 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, 1] [2023-02-15 01:00:36,015 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, 1] [2023-02-15 01:00:38,030 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, 1] [2023-02-15 01:00:40,033 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, 1] [2023-02-15 01:00:42,036 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, 1] [2023-02-15 01:00:44,040 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, 1] [2023-02-15 01:00:46,043 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, 1] [2023-02-15 01:00:48,045 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, 1] [2023-02-15 01:00:50,623 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, 1] [2023-02-15 01:00:52,624 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, 1] [2023-02-15 01:00:54,627 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, 1] [2023-02-15 01:00:56,632 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, 1] [2023-02-15 01:00:58,635 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, 1] [2023-02-15 01:01:00,637 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, 1] [2023-02-15 01:01:02,711 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, 1] [2023-02-15 01:01:04,714 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, 1] [2023-02-15 01:01:06,716 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, 1] [2023-02-15 01:01:08,719 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, 1] [2023-02-15 01:01:10,724 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, 1] [2023-02-15 01:01:12,728 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, 1] [2023-02-15 01:01:15,041 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, 1] [2023-02-15 01:01:17,052 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, 1] [2023-02-15 01:01:19,055 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, 1] [2023-02-15 01:01:21,057 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, 1] [2023-02-15 01:01:23,060 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, 1] [2023-02-15 01:01:25,062 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, 1] [2023-02-15 01:01:27,065 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, 1] [2023-02-15 01:01:29,097 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, 1] [2023-02-15 01:01:31,100 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, 1] [2023-02-15 01:01:33,105 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, 1] [2023-02-15 01:01:35,108 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, 1] [2023-02-15 01:01:37,111 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, 1] [2023-02-15 01:01:39,398 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, 1] [2023-02-15 01:01:41,401 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, 1] [2023-02-15 01:01:43,405 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, 1] [2023-02-15 01:01:45,408 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, 1] [2023-02-15 01:01:47,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, 1] [2023-02-15 01:01:49,730 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, 1] [2023-02-15 01:01:51,733 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, 1] [2023-02-15 01:01:53,737 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, 1] [2023-02-15 01:01:55,740 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, 1] [2023-02-15 01:01:57,743 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, 1] [2023-02-15 01:01:59,745 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, 1] [2023-02-15 01:02:01,821 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, 1]