./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:45:48,020 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:45:48,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:45:48,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:45:48,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:45:48,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:45:48,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:45:48,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:45:48,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:45:48,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:45:48,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:45:48,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:45:48,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:45:48,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:45:48,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:45:48,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:45:48,080 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:45:48,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:45:48,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:45:48,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:45:48,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:45:48,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:45:48,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:45:48,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:45:48,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:45:48,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:45:48,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:45:48,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:45:48,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:45:48,097 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:45:48,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:45:48,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:45:48,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:45:48,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:45:48,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:45:48,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:45:48,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:45:48,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:45:48,102 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:45:48,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:45:48,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:45:48,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:45:48,126 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:45:48,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:45:48,126 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:45:48,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:45:48,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:45:48,127 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:45:48,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:45:48,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:45:48,128 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:45:48,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:45:48,129 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:45:48,129 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:45:48,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:45:48,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:45:48,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:45:48,129 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:45:48,130 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:45:48,130 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:45:48,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:45:48,130 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:45:48,130 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:45:48,130 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:45:48,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:45:48,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:45:48,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:45:48,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:45:48,131 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:45:48,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:45:48,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:45:48,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:45:48,132 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:45:48,132 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:45:48,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:45:48,132 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:45:48,132 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 [2023-02-15 21:45:48,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:45:48,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:45:48,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:45:48,347 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:45:48,348 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:45:48,348 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-15 21:45:49,319 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:45:49,497 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:45:49,498 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-15 21:45:49,505 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3b88e34/a903fb22f0344752b82011b759976878/FLAG2272c9555 [2023-02-15 21:45:49,527 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e3b88e34/a903fb22f0344752b82011b759976878 [2023-02-15 21:45:49,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:45:49,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:45:49,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:45:49,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:45:49,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:45:49,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:45:49" (1/1) ... [2023-02-15 21:45:49,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d558ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:49, skipping insertion in model container [2023-02-15 21:45:49,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:45:49" (1/1) ... [2023-02-15 21:45:49,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:45:49,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:45:49,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:45:49,827 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 21:45:49,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@399bbce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:49, skipping insertion in model container [2023-02-15 21:45:49,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:45:49,829 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 21:45:49,831 INFO L158 Benchmark]: Toolchain (without parser) took 298.78ms. Allocated memory is still 163.6MB. Free memory was 135.3MB in the beginning and 132.4MB in the end (delta: 2.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2023-02-15 21:45:49,831 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:45:49,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.07ms. Allocated memory is still 163.6MB. Free memory was 135.1MB in the beginning and 132.4MB in the end (delta: 2.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2023-02-15 21:45:49,833 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 119.5MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.07ms. Allocated memory is still 163.6MB. Free memory was 135.1MB in the beginning and 132.4MB in the end (delta: 2.7MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 533]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/array02-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:45:51,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:45:51,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:45:51,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:45:51,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:45:51,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:45:51,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:45:51,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:45:51,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:45:51,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:45:51,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:45:51,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:45:51,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:45:51,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:45:51,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:45:51,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:45:51,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:45:51,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:45:51,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:45:51,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:45:51,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:45:51,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:45:51,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:45:51,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:45:51,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:45:51,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:45:51,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:45:51,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:45:51,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:45:51,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:45:51,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:45:51,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:45:51,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:45:51,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:45:51,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:45:51,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:45:51,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:45:51,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:45:51,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:45:51,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:45:51,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:45:51,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 21:45:51,765 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:45:51,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:45:51,766 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:45:51,766 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:45:51,767 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:45:51,767 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:45:51,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:45:51,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:45:51,768 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:45:51,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:45:51,768 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:45:51,768 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:45:51,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:45:51,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:45:51,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:45:51,769 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:45:51,769 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:45:51,769 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:45:51,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:45:51,770 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:45:51,770 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 21:45:51,770 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 21:45:51,770 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:45:51,770 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:45:51,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:45:51,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:45:51,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:45:51,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:45:51,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:45:51,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:45:51,772 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 21:45:51,772 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 21:45:51,772 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:45:51,772 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:45:51,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:45:51,773 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 21:45:51,773 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:45:51,773 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6376f52a263bde0c709cb35a0d040626ae764c5527f8161f54a95df7802768d2 [2023-02-15 21:45:52,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:45:52,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:45:52,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:45:52,065 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:45:52,066 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:45:52,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-15 21:45:53,152 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:45:53,385 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:45:53,385 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2023-02-15 21:45:53,393 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c50af283/70ed31b18e484060949e87f0b09fe4a7/FLAG07954098d [2023-02-15 21:45:53,405 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c50af283/70ed31b18e484060949e87f0b09fe4a7 [2023-02-15 21:45:53,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:45:53,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:45:53,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:45:53,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:45:53,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:45:53,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f52c27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53, skipping insertion in model container [2023-02-15 21:45:53,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:45:53,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:45:53,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:45:53,682 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 21:45:53,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:45:53,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:45:53,727 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:45:53,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:45:53,780 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:45:53,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53 WrapperNode [2023-02-15 21:45:53,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:45:53,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:45:53,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:45:53,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:45:53,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,822 INFO L138 Inliner]: procedures = 117, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2023-02-15 21:45:53,823 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:45:53,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:45:53,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:45:53,824 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:45:53,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,866 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:45:53,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:45:53,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:45:53,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:45:53,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (1/1) ... [2023-02-15 21:45:53,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:45:53,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:45:53,913 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 21:45:53,920 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 21:45:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 21:45:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 21:45:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:45:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 21:45:53,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:45:53,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:45:54,033 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:45:54,035 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:45:54,269 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:45:54,273 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:45:54,273 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 21:45:54,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:45:54 BoogieIcfgContainer [2023-02-15 21:45:54,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:45:54,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:45:54,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:45:54,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:45:54,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:45:53" (1/3) ... [2023-02-15 21:45:54,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d4173e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:45:54, skipping insertion in model container [2023-02-15 21:45:54,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:45:53" (2/3) ... [2023-02-15 21:45:54,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d4173e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:45:54, skipping insertion in model container [2023-02-15 21:45:54,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:45:54" (3/3) ... [2023-02-15 21:45:54,280 INFO L112 eAbstractionObserver]: Analyzing ICFG array02-alloca-2.i [2023-02-15 21:45:54,291 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:45:54,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2023-02-15 21:45:54,327 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:45:54,332 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;@5f5ec894, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:45:54,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-02-15 21:45:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 21:45:54,339 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:54,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 21:45:54,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2023-02-15 21:45:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:54,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525044151] [2023-02-15 21:45:54,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:54,355 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 21:45:54,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:54,358 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 21:45:54,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 21:45:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:54,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 21:45:54,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:54,522 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 21:45:54,547 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 21:45:54,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:45:54,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:54,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525044151] [2023-02-15 21:45:54,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525044151] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:45:54,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:45:54,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:45:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019362489] [2023-02-15 21:45:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:45:54,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:45:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:45:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:45:54,584 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:54,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:54,657 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-02-15 21:45:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:45:54,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 21:45:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:54,664 INFO L225 Difference]: With dead ends: 41 [2023-02-15 21:45:54,664 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 21:45:54,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:45:54,668 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:54,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 32 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 21:45:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-15 21:45:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.72) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-02-15 21:45:54,692 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 6 [2023-02-15 21:45:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:54,692 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-02-15 21:45:54,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-02-15 21:45:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 21:45:54,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:54,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 21:45:54,713 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 21:45:54,916 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 21:45:54,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:54,918 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2023-02-15 21:45:54,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:54,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73800688] [2023-02-15 21:45:54,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:54,919 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 21:45:54,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:54,922 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 21:45:54,922 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 21:45:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:55,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:45:55,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:55,035 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 21:45:55,064 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 21:45:55,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:45:55,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:55,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73800688] [2023-02-15 21:45:55,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73800688] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:45:55,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:45:55,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:45:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385550903] [2023-02-15 21:45:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:45:55,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:45:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:45:55,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:45:55,072 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:55,238 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2023-02-15 21:45:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:45:55,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 21:45:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:55,239 INFO L225 Difference]: With dead ends: 79 [2023-02-15 21:45:55,239 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 21:45:55,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:45:55,240 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:55,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 150 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 21:45:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 42. [2023-02-15 21:45:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2023-02-15 21:45:55,244 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 6 [2023-02-15 21:45:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:55,246 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2023-02-15 21:45:55,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2023-02-15 21:45:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 21:45:55,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:55,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 21:45:55,254 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 (3)] Ended with exit code 0 [2023-02-15 21:45:55,449 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 21:45:55,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:55,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2023-02-15 21:45:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:55,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723233774] [2023-02-15 21:45:55,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:45:55,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:55,452 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 21:45:55,455 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 21:45:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:55,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:45:55,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:55,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:45:55,579 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 21:45:55,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:45:55,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723233774] [2023-02-15 21:45:55,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723233774] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:45:55,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:45:55,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:45:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042915623] [2023-02-15 21:45:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:45:55,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:45:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:45:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:45:55,584 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:55,694 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2023-02-15 21:45:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:45:55,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 21:45:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:55,695 INFO L225 Difference]: With dead ends: 46 [2023-02-15 21:45:55,695 INFO L226 Difference]: Without dead ends: 46 [2023-02-15 21:45:55,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:45:55,696 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:55,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 61 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-02-15 21:45:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2023-02-15 21:45:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-02-15 21:45:55,699 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 6 [2023-02-15 21:45:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:55,699 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-02-15 21:45:55,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-02-15 21:45:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 21:45:55,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:55,700 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:45:55,708 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 21:45:55,906 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 21:45:55,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:55,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:55,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2023-02-15 21:45:55,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:55,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557340241] [2023-02-15 21:45:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:55,907 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 21:45:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:55,912 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 21:45:55,914 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 21:45:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:55,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 21:45:55,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:45:55,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:45:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:45:56,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:56,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557340241] [2023-02-15 21:45:56,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557340241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:45:56,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:45:56,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-15 21:45:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271902656] [2023-02-15 21:45:56,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:45:56,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:45:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:56,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:45:56,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:45:56,060 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:56,119 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2023-02-15 21:45:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:45:56,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 21:45:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:56,122 INFO L225 Difference]: With dead ends: 77 [2023-02-15 21:45:56,122 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 21:45:56,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:45:56,123 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 164 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:56,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 177 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:56,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 21:45:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2023-02-15 21:45:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-02-15 21:45:56,128 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 10 [2023-02-15 21:45:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:56,128 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-02-15 21:45:56,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-02-15 21:45:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 21:45:56,128 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:56,128 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:45:56,150 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 21:45:56,329 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 21:45:56,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:56,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2023-02-15 21:45:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:56,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101062131] [2023-02-15 21:45:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:56,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:45:56,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:56,341 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 21:45:56,343 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 21:45:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:56,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 21:45:56,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:56,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:45:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:45:56,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:45:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:45:56,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:56,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101062131] [2023-02-15 21:45:56,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101062131] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:45:56,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:45:56,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-15 21:45:56,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744144956] [2023-02-15 21:45:56,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:45:56,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 21:45:56,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:56,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 21:45:56,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:45:56,791 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:57,646 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2023-02-15 21:45:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:45:57,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 21:45:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:57,648 INFO L225 Difference]: With dead ends: 119 [2023-02-15 21:45:57,648 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 21:45:57,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:45:57,649 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 322 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:57,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 116 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 21:45:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 21:45:57,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 59. [2023-02-15 21:45:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 58 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2023-02-15 21:45:57,655 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 10 [2023-02-15 21:45:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:57,655 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2023-02-15 21:45:57,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2023-02-15 21:45:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 21:45:57,656 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:57,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:45:57,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 21:45:57,862 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 21:45:57,863 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:57,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash -680998148, now seen corresponding path program 1 times [2023-02-15 21:45:57,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:57,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73387837] [2023-02-15 21:45:57,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:57,864 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 21:45:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:57,865 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 21:45:57,867 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 21:45:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:57,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 21:45:57,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:57,906 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 21:45:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:45:57,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:45:57,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:57,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73387837] [2023-02-15 21:45:57,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73387837] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:45:57,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:45:57,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:45:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532667430] [2023-02-15 21:45:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:45:57,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:45:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:45:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:45:57,926 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:57,994 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-02-15 21:45:57,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:45:57,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 21:45:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:57,996 INFO L225 Difference]: With dead ends: 53 [2023-02-15 21:45:57,996 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 21:45:57,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:45:57,997 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:57,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 21:45:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-15 21:45:57,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-02-15 21:45:58,000 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 12 [2023-02-15 21:45:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:58,000 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-02-15 21:45:58,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-02-15 21:45:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 21:45:58,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:58,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:45:58,029 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 21:45:58,208 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 21:45:58,209 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:58,209 INFO L85 PathProgramCache]: Analyzing trace with hash -680998147, now seen corresponding path program 1 times [2023-02-15 21:45:58,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:58,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251518798] [2023-02-15 21:45:58,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:58,210 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 21:45:58,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:58,211 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 21:45:58,213 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 21:45:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:58,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 21:45:58,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:58,262 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 21:45:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:45:58,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:45:58,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:58,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251518798] [2023-02-15 21:45:58,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251518798] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:45:58,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:45:58,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:45:58,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342355028] [2023-02-15 21:45:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:45:58,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:45:58,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:58,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:45:58,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:45:58,294 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:58,441 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2023-02-15 21:45:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:45:58,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 21:45:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:58,442 INFO L225 Difference]: With dead ends: 94 [2023-02-15 21:45:58,442 INFO L226 Difference]: Without dead ends: 94 [2023-02-15 21:45:58,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:45:58,442 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 113 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:58,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-15 21:45:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 67. [2023-02-15 21:45:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.305084745762712) internal successors, (77), 66 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2023-02-15 21:45:58,446 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 12 [2023-02-15 21:45:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:58,446 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2023-02-15 21:45:58,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2023-02-15 21:45:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 21:45:58,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:58,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:45:58,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 21:45:58,646 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 21:45:58,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:58,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:58,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025157, now seen corresponding path program 1 times [2023-02-15 21:45:58,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:58,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505526212] [2023-02-15 21:45:58,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:58,648 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 21:45:58,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:58,648 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 21:45:58,649 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 21:45:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:58,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 21:45:58,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:58,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:45:58,887 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 21:45:58,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:45:59,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:45:59,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:59,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505526212] [2023-02-15 21:45:59,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505526212] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 21:45:59,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 21:45:59,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-02-15 21:45:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299648021] [2023-02-15 21:45:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:45:59,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:45:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:59,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:45:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:45:59,086 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:59,243 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-02-15 21:45:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:45:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 21:45:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:59,245 INFO L225 Difference]: With dead ends: 67 [2023-02-15 21:45:59,245 INFO L226 Difference]: Without dead ends: 67 [2023-02-15 21:45:59,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:45:59,246 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:59,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-02-15 21:45:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2023-02-15 21:45:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-02-15 21:45:59,248 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 12 [2023-02-15 21:45:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:59,248 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-02-15 21:45:59,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-02-15 21:45:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:45:59,249 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:59,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:45:59,256 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 21:45:59,457 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 21:45:59,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash 363893421, now seen corresponding path program 1 times [2023-02-15 21:45:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:59,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948241353] [2023-02-15 21:45:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:45:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:59,461 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 21:45:59,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 21:45:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:59,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 21:45:59,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:59,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:45:59,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:45:59,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948241353] [2023-02-15 21:45:59,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948241353] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:45:59,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:45:59,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:45:59,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043182665] [2023-02-15 21:45:59,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:45:59,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:45:59,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:45:59,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:45:59,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:45:59,518 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:45:59,598 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2023-02-15 21:45:59,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:45:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 21:45:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:45:59,600 INFO L225 Difference]: With dead ends: 84 [2023-02-15 21:45:59,600 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 21:45:59,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:45:59,600 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:45:59,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 76 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:45:59,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 21:45:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 52. [2023-02-15 21:45:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2023-02-15 21:45:59,603 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 13 [2023-02-15 21:45:59,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:45:59,603 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2023-02-15 21:45:59,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:45:59,603 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2023-02-15 21:45:59,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:45:59,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:45:59,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:45:59,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 21:45:59,808 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 21:45:59,808 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:45:59,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:45:59,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1064957999, now seen corresponding path program 1 times [2023-02-15 21:45:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:45:59,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838598111] [2023-02-15 21:45:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:45:59,809 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 21:45:59,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:45:59,811 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 21:45:59,814 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 21:45:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:45:59,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:45:59,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:45:59,932 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 21:45:59,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:45:59,996 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 21:45:59,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:45:59,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838598111] [2023-02-15 21:45:59,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838598111] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:45:59,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:45:59,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-15 21:45:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777827303] [2023-02-15 21:45:59,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:45:59,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 21:46:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 21:46:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:46:00,003 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:00,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:00,216 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-02-15 21:46:00,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 21:46:00,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 21:46:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:00,217 INFO L225 Difference]: With dead ends: 86 [2023-02-15 21:46:00,217 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 21:46:00,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2023-02-15 21:46:00,218 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 185 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:00,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 84 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 21:46:00,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 50. [2023-02-15 21:46:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2023-02-15 21:46:00,219 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2023-02-15 21:46:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:00,220 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2023-02-15 21:46:00,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2023-02-15 21:46:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:46:00,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:00,221 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:00,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:00,421 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 21:46:00,421 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:46:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2110205631, now seen corresponding path program 1 times [2023-02-15 21:46:00,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:00,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924846006] [2023-02-15 21:46:00,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:00,422 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 21:46:00,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:00,423 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 21:46:00,434 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 21:46:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:00,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 21:46:00,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:00,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:00,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:00,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:00,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924846006] [2023-02-15 21:46:00,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924846006] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:00,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:00,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-15 21:46:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246530557] [2023-02-15 21:46:00,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:00,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:46:00,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:00,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:46:00,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:46:00,556 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:00,632 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-02-15 21:46:00,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:46:00,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 21:46:00,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:00,633 INFO L225 Difference]: With dead ends: 69 [2023-02-15 21:46:00,633 INFO L226 Difference]: Without dead ends: 69 [2023-02-15 21:46:00,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:46:00,634 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 68 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:00,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 82 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:46:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-15 21:46:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2023-02-15 21:46:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2023-02-15 21:46:00,637 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 18 [2023-02-15 21:46:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:00,637 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2023-02-15 21:46:00,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2023-02-15 21:46:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:46:00,638 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:00,638 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:00,644 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 21:46:00,845 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 21:46:00,845 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:46:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1163693311, now seen corresponding path program 1 times [2023-02-15 21:46:00,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:00,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551101839] [2023-02-15 21:46:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:00,846 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 21:46:00,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:00,847 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 21:46:00,849 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 21:46:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:00,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 21:46:00,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:00,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:46:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:01,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:01,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 21:46:01,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:01,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551101839] [2023-02-15 21:46:01,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551101839] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:01,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:01,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-15 21:46:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492983810] [2023-02-15 21:46:01,454 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:01,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:46:01,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:01,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:46:01,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:46:01,455 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:02,104 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2023-02-15 21:46:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:46:02,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 21:46:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:02,106 INFO L225 Difference]: With dead ends: 117 [2023-02-15 21:46:02,106 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 21:46:02,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:46:02,107 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 367 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:02,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 92 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:46:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 21:46:02,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2023-02-15 21:46:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2023-02-15 21:46:02,109 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 18 [2023-02-15 21:46:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:02,110 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2023-02-15 21:46:02,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2023-02-15 21:46:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 21:46:02,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:02,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:02,119 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 21:46:02,317 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 21:46:02,317 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:46:02,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash -991865623, now seen corresponding path program 1 times [2023-02-15 21:46:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:02,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104653342] [2023-02-15 21:46:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:46:02,318 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 21:46:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:02,319 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 21:46:02,321 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 21:46:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:46:02,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 21:46:02,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:02,453 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc12#1.base_11| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc12#1.base_11|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc12#1.base_11| (_ bv0 1))))) is different from true [2023-02-15 21:46:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 21:46:02,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:46:02,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:02,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104653342] [2023-02-15 21:46:02,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104653342] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:46:02,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:46:02,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:46:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689666430] [2023-02-15 21:46:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:46:02,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:46:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:02,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:46:02,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 21:46:02,456 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:02,533 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2023-02-15 21:46:02,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:46:02,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 21:46:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:02,535 INFO L225 Difference]: With dead ends: 107 [2023-02-15 21:46:02,535 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 21:46:02,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-15 21:46:02,535 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:02,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2023-02-15 21:46:02,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 21:46:02,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 21:46:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.1728395061728396) internal successors, (95), 82 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2023-02-15 21:46:02,537 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 19 [2023-02-15 21:46:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:02,537 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2023-02-15 21:46:02,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:02,537 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2023-02-15 21:46:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 21:46:02,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:02,538 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-15 21:46:02,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 21:46:02,744 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 21:46:02,745 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:46:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash 302966996, now seen corresponding path program 2 times [2023-02-15 21:46:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:02,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315513807] [2023-02-15 21:46:02,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:46:02,745 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 21:46:02,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:02,746 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 21:46:02,753 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 21:46:02,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:46:02,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:46:02,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 21:46:02,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:02,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:46:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:46:03,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:46:04,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315513807] [2023-02-15 21:46:04,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315513807] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:04,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:04,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-15 21:46:04,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705607569] [2023-02-15 21:46:04,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:04,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 21:46:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:04,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 21:46:04,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:46:04,616 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:08,313 INFO L93 Difference]: Finished difference Result 587 states and 669 transitions. [2023-02-15 21:46:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 21:46:08,314 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 21:46:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:08,315 INFO L225 Difference]: With dead ends: 587 [2023-02-15 21:46:08,315 INFO L226 Difference]: Without dead ends: 587 [2023-02-15 21:46:08,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2023-02-15 21:46:08,316 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 792 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:08,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 299 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 21:46:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2023-02-15 21:46:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 107. [2023-02-15 21:46:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 106 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:08,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2023-02-15 21:46:08,320 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 22 [2023-02-15 21:46:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:08,320 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2023-02-15 21:46:08,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2023-02-15 21:46:08,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 21:46:08,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:08,321 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:08,336 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 21:46:08,527 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 21:46:08,528 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:46:08,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:08,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1408555595, now seen corresponding path program 2 times [2023-02-15 21:46:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:08,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243297961] [2023-02-15 21:46:08,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:46:08,529 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 21:46:08,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:08,530 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 21:46:08,535 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 21:46:08,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:46:08,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:46:08,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 21:46:08,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:08,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:46:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:46:08,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:46:10,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:10,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243297961] [2023-02-15 21:46:10,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243297961] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:10,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:10,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 21:46:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737749315] [2023-02-15 21:46:10,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:10,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 21:46:10,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 21:46:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:46:10,193 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:13,635 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2023-02-15 21:46:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 21:46:13,636 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 21:46:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:13,637 INFO L225 Difference]: With dead ends: 207 [2023-02-15 21:46:13,637 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 21:46:13,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 21:46:13,638 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 489 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:13,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 290 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 21:46:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 21:46:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 122. [2023-02-15 21:46:13,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 120 states have (on average 1.175) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2023-02-15 21:46:13,640 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 36 [2023-02-15 21:46:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:13,640 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2023-02-15 21:46:13,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2023-02-15 21:46:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 21:46:13,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:13,641 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1] [2023-02-15 21:46:13,650 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 21:46:13,841 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 21:46:13,842 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:46:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1048882662, now seen corresponding path program 3 times [2023-02-15 21:46:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399503941] [2023-02-15 21:46:13,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 21:46:13,843 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 21:46:13,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:13,844 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 21:46:13,846 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 21:46:14,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 21:46:14,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:46:14,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 21:46:14,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:14,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:46:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:46:14,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:46:16,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:46:16,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399503941] [2023-02-15 21:46:16,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399503941] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:46:16,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:46:16,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-02-15 21:46:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053299068] [2023-02-15 21:46:16,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:46:16,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 21:46:16,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:46:16,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 21:46:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2023-02-15 21:46:16,951 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:46:38,930 INFO L93 Difference]: Finished difference Result 1323 states and 1508 transitions. [2023-02-15 21:46:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-02-15 21:46:38,932 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-15 21:46:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:46:38,935 INFO L225 Difference]: With dead ends: 1323 [2023-02-15 21:46:38,935 INFO L226 Difference]: Without dead ends: 1323 [2023-02-15 21:46:38,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=1166, Invalid=2494, Unknown=0, NotChecked=0, Total=3660 [2023-02-15 21:46:38,936 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 3131 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3131 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:46:38,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3131 Valid, 1271 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-02-15 21:46:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2023-02-15 21:46:38,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 170. [2023-02-15 21:46:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.1964285714285714) internal successors, (201), 169 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:38,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2023-02-15 21:46:38,953 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 46 [2023-02-15 21:46:38,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:46:38,956 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2023-02-15 21:46:38,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:46:38,956 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2023-02-15 21:46:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 21:46:38,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:46:38,960 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:46:38,969 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 21:46:39,168 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 21:46:39,168 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:46:39,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:46:39,169 INFO L85 PathProgramCache]: Analyzing trace with hash 873306578, now seen corresponding path program 3 times [2023-02-15 21:46:39,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:46:39,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603716029] [2023-02-15 21:46:39,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 21:46:39,169 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 21:46:39,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:46:39,170 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 21:46:39,172 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 21:46:39,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 21:46:39,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:46:39,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 21:46:39,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:46:39,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:46:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 46 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 21:46:40,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:46:54,374 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:47:01,279 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:47:08,187 WARN L233 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:47:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 21:47:08,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:47:08,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603716029] [2023-02-15 21:47:08,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603716029] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:47:08,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:47:08,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2023-02-15 21:47:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5819345] [2023-02-15 21:47:08,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:47:08,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 21:47:08,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:47:08,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 21:47:08,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=587, Unknown=2, NotChecked=0, Total=702 [2023-02-15 21:47:08,201 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:47:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:47:12,859 INFO L93 Difference]: Finished difference Result 206 states and 240 transitions. [2023-02-15 21:47:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 21:47:12,861 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-15 21:47:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:47:12,861 INFO L225 Difference]: With dead ends: 206 [2023-02-15 21:47:12,861 INFO L226 Difference]: Without dead ends: 175 [2023-02-15 21:47:12,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=213, Invalid=907, Unknown=2, NotChecked=0, Total=1122 [2023-02-15 21:47:12,862 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 265 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:47:12,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 240 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-02-15 21:47:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-15 21:47:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2023-02-15 21:47:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.1904761904761905) internal successors, (200), 169 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:47:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 200 transitions. [2023-02-15 21:47:12,864 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 200 transitions. Word has length 46 [2023-02-15 21:47:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:47:12,864 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 200 transitions. [2023-02-15 21:47:12,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.769230769230769) internal successors, (72), 27 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:47:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 200 transitions. [2023-02-15 21:47:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 21:47:12,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:47:12,865 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:47:12,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-02-15 21:47:13,073 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 21:47:13,073 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:47:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:47:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash 82156500, now seen corresponding path program 4 times [2023-02-15 21:47:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:47:13,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044280789] [2023-02-15 21:47:13,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 21:47:13,074 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 21:47:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:47:13,088 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 21:47:13,094 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 21:47:13,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 21:47:13,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:47:13,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 21:47:13,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:47:13,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:47:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 21:47:15,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:47:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 21:47:18,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:47:18,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044280789] [2023-02-15 21:47:18,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044280789] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:47:18,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:47:18,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-02-15 21:47:18,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301494178] [2023-02-15 21:47:18,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:47:18,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 21:47:18,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:47:18,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 21:47:18,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:47:18,497 INFO L87 Difference]: Start difference. First operand 170 states and 200 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:47:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:47:26,296 INFO L93 Difference]: Finished difference Result 303 states and 351 transitions. [2023-02-15 21:47:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 21:47:26,297 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-15 21:47:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:47:26,298 INFO L225 Difference]: With dead ends: 303 [2023-02-15 21:47:26,298 INFO L226 Difference]: Without dead ends: 303 [2023-02-15 21:47:26,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 21:47:26,299 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 738 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:47:26,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 312 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-15 21:47:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2023-02-15 21:47:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 239. [2023-02-15 21:47:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 237 states have (on average 1.1772151898734178) internal successors, (279), 238 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:47:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 279 transitions. [2023-02-15 21:47:26,303 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 279 transitions. Word has length 48 [2023-02-15 21:47:26,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:47:26,304 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 279 transitions. [2023-02-15 21:47:26,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:47:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 279 transitions. [2023-02-15 21:47:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-15 21:47:26,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:47:26,306 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:47:26,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 21:47:26,513 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 21:47:26,513 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:47:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:47:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1193800553, now seen corresponding path program 5 times [2023-02-15 21:47:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:47:26,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820036773] [2023-02-15 21:47:26,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 21:47:26,514 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 21:47:26,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:47:26,516 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 21:47:26,518 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 21:47:26,730 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-02-15 21:47:26,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:47:26,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 21:47:26,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:47:26,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:47:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 132 proven. 155 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 21:47:29,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:47:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:47:37,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:47:37,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820036773] [2023-02-15 21:47:37,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820036773] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:47:37,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:47:37,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2023-02-15 21:47:37,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175519367] [2023-02-15 21:47:37,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:47:37,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 21:47:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:47:37,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 21:47:37,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 21:47:37,987 INFO L87 Difference]: Start difference. First operand 239 states and 279 transitions. Second operand has 35 states, 35 states have (on average 4.2) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:48:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:48:02,799 INFO L93 Difference]: Finished difference Result 465 states and 532 transitions. [2023-02-15 21:48:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-15 21:48:02,801 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.2) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2023-02-15 21:48:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:48:02,802 INFO L225 Difference]: With dead ends: 465 [2023-02-15 21:48:02,802 INFO L226 Difference]: Without dead ends: 418 [2023-02-15 21:48:02,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=858, Invalid=4112, Unknown=0, NotChecked=0, Total=4970 [2023-02-15 21:48:02,803 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 943 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:48:02,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1225 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2023-02-15 21:48:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-15 21:48:02,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 254. [2023-02-15 21:48:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 1.1706349206349207) internal successors, (295), 253 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:48:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 295 transitions. [2023-02-15 21:48:02,807 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 295 transitions. Word has length 80 [2023-02-15 21:48:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:48:02,807 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 295 transitions. [2023-02-15 21:48:02,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.2) internal successors, (147), 35 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:48:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 295 transitions. [2023-02-15 21:48:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-15 21:48:02,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:48:02,808 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:48:02,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 21:48:03,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:48:03,013 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:48:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:48:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash 625249264, now seen corresponding path program 6 times [2023-02-15 21:48:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:48:03,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119684079] [2023-02-15 21:48:03,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 21:48:03,014 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 21:48:03,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:48:03,015 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:48:03,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 21:48:03,285 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2023-02-15 21:48:03,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:48:03,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 21:48:03,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:48:03,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:48:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 248 proven. 40 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-02-15 21:48:07,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:48:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 204 proven. 84 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-02-15 21:48:19,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:48:19,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119684079] [2023-02-15 21:48:19,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119684079] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:48:19,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:48:19,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-15 21:48:19,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733724890] [2023-02-15 21:48:19,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:48:19,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 21:48:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:48:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 21:48:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 21:48:19,687 INFO L87 Difference]: Start difference. First operand 254 states and 295 transitions. Second operand has 34 states, 34 states have (on average 3.264705882352941) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:48:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:48:25,937 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2023-02-15 21:48:25,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 21:48:25,940 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.264705882352941) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2023-02-15 21:48:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:48:25,941 INFO L225 Difference]: With dead ends: 316 [2023-02-15 21:48:25,941 INFO L226 Difference]: Without dead ends: 254 [2023-02-15 21:48:25,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=414, Invalid=1478, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 21:48:25,942 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 192 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:48:25,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 443 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-02-15 21:48:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-15 21:48:25,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2023-02-15 21:48:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 252 states have (on average 1.1666666666666667) internal successors, (294), 253 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:48:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 294 transitions. [2023-02-15 21:48:25,944 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 294 transitions. Word has length 90 [2023-02-15 21:48:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:48:25,945 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 294 transitions. [2023-02-15 21:48:25,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.264705882352941) internal successors, (111), 34 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:48:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 294 transitions. [2023-02-15 21:48:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-02-15 21:48:25,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:48:25,945 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1] [2023-02-15 21:48:25,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 21:48:26,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:48:26,146 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-02-15 21:48:26,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:48:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2084926986, now seen corresponding path program 4 times [2023-02-15 21:48:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:48:26,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151943585] [2023-02-15 21:48:26,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 21:48:26,146 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 21:48:26,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:48:26,147 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:48:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 21:48:26,282 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 21:48:26,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:48:26,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 21:48:26,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:48:26,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-02-15 21:48:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:48:32,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:48:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:48:50,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:48:50,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151943585] [2023-02-15 21:48:50,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151943585] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:48:50,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:48:50,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2023-02-15 21:48:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534533691] [2023-02-15 21:48:50,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:48:50,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 21:48:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:48:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 21:48:50,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=2451, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 21:48:50,479 INFO L87 Difference]: Start difference. First operand 254 states and 294 transitions. Second operand has 58 states, 57 states have (on average 3.263157894736842) internal successors, (186), 58 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:49:32,077 WARN L233 SmtUtils]: Spent 17.46s on a formula simplification that was a NOOP. DAG size: 258 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:50:06,153 WARN L233 SmtUtils]: Spent 32.42s on a formula simplification. DAG size of input: 254 DAG size of output: 254 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 21:50:08,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 21:50:10,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 21:50:12,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 21:50:28,359 WARN L233 SmtUtils]: Spent 14.43s on a formula simplification that was a NOOP. DAG size: 248 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)