./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:34:42,559 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:34:42,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:34:42,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:34:42,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:34:42,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:34:42,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:34:42,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:34:42,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:34:42,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:34:42,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:34:42,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:34:42,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:34:42,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:34:42,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:34:42,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:34:42,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:34:42,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:34:42,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:34:42,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:34:42,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:34:42,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:34:42,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:34:42,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:34:42,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:34:42,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:34:42,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:34:42,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:34:42,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:34:42,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:34:42,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:34:42,649 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:34:42,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:34:42,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:34:42,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:34:42,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:34:42,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:34:42,653 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:34:42,653 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:34:42,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:34:42,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:34:42,657 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-02-15 22:34:42,685 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:34:42,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:34:42,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:34:42,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:34:42,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:34:42,688 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:34:42,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:34:42,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:34:42,695 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:34:42,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:34:42,696 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:34:42,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:34:42,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:34:42,696 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:34:42,697 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:34:42,697 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:34:42,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:34:42,697 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:34:42,697 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:34:42,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:34:42,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:34:42,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:34:42,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:42,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:34:42,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:34:42,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:34:42,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:34:42,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:34:42,700 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:34:42,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:34:42,700 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:34:42,700 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2023-02-15 22:34:42,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:34:42,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:34:42,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:34:42,968 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:34:42,969 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:34:42,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-02-15 22:34:44,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:34:44,322 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:34:44,323 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-02-15 22:34:44,345 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6a20245/23cae5f5b458494588b13a43df6f9402/FLAG0dc55a48c [2023-02-15 22:34:44,358 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a6a20245/23cae5f5b458494588b13a43df6f9402 [2023-02-15 22:34:44,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:34:44,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:34:44,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:44,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:34:44,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:34:44,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:44" (1/1) ... [2023-02-15 22:34:44,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf54a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:44, skipping insertion in model container [2023-02-15 22:34:44,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:44" (1/1) ... [2023-02-15 22:34:44,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:34:44,432 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:34:45,025 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2023-02-15 22:34:45,044 WARN L623 FunctionHandler]: Unknown extern function strrchr [2023-02-15 22:34:45,055 WARN L623 FunctionHandler]: Unknown extern function write [2023-02-15 22:34:45,076 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:34:45,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:45,117 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 22:34:45,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2aa07e85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:45, skipping insertion in model container [2023-02-15 22:34:45,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:45,118 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 22:34:45,120 INFO L158 Benchmark]: Toolchain (without parser) took 757.30ms. Allocated memory is still 136.3MB. Free memory was 87.0MB in the beginning and 66.7MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 22:34:45,120 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:34:45,121 INFO L158 Benchmark]: CACSL2BoogieTranslator took 755.44ms. Allocated memory is still 136.3MB. Free memory was 87.0MB in the beginning and 66.7MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 22:34:45,123 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.17ms. Allocated memory is still 136.3MB. Free memory was 105.2MB in the beginning and 105.1MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 755.44ms. Allocated memory is still 136.3MB. Free memory was 87.0MB in the beginning and 66.7MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1515]: 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/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:34:47,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:34:47,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:34:47,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:34:47,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:34:47,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:34:47,058 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:34:47,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:34:47,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:34:47,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:34:47,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:34:47,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:34:47,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:34:47,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:34:47,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:34:47,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:34:47,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:34:47,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:34:47,070 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:34:47,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:34:47,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:34:47,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:34:47,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:34:47,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:34:47,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:34:47,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:34:47,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:34:47,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:34:47,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:34:47,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:34:47,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:34:47,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:34:47,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:34:47,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:34:47,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:34:47,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:34:47,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:34:47,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:34:47,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:34:47,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:34:47,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:34:47,094 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-02-15 22:34:47,126 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:34:47,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:34:47,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:34:47,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:34:47,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:34:47,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:34:47,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:34:47,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:34:47,131 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:34:47,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:34:47,132 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:34:47,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:34:47,132 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:34:47,132 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:34:47,132 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:34:47,133 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:34:47,133 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:34:47,133 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:34:47,133 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:34:47,133 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:34:47,134 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:34:47,134 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:34:47,134 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:34:47,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:34:47,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:47,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:34:47,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:34:47,135 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:34:47,135 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:34:47,135 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:34:47,135 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:34:47,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:34:47,136 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:34:47,136 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:34:47,136 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65aca230ed2b7a8b5f7f2ccd484c93b0425fe4f5fb1895001f199a0c2754f5f4 [2023-02-15 22:34:47,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:34:47,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:34:47,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:34:47,425 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:34:47,425 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:34:47,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-02-15 22:34:48,588 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:34:48,923 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:34:48,928 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2023-02-15 22:34:48,947 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70f8ce64/678bfff3dc144a299ab71b1f5015db2c/FLAGd537eb06d [2023-02-15 22:34:48,959 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f70f8ce64/678bfff3dc144a299ab71b1f5015db2c [2023-02-15 22:34:48,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:34:48,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:34:48,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:48,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:34:48,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:34:48,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:48,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d90c7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:48, skipping insertion in model container [2023-02-15 22:34:48,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:34:48" (1/1) ... [2023-02-15 22:34:48,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:34:49,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:34:49,483 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2023-02-15 22:34:49,492 WARN L623 FunctionHandler]: Unknown extern function strrchr [2023-02-15 22:34:49,510 WARN L623 FunctionHandler]: Unknown extern function write [2023-02-15 22:34:49,526 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:34:49,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:49,554 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:34:49,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:34:49,638 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2023-02-15 22:34:49,675 WARN L623 FunctionHandler]: Unknown extern function strrchr [2023-02-15 22:34:49,681 WARN L623 FunctionHandler]: Unknown extern function write [2023-02-15 22:34:49,688 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:34:49,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:49,703 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:34:49,762 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i[58057,58070] [2023-02-15 22:34:49,766 WARN L623 FunctionHandler]: Unknown extern function strrchr [2023-02-15 22:34:49,775 WARN L623 FunctionHandler]: Unknown extern function write [2023-02-15 22:34:49,788 WARN L623 FunctionHandler]: Unknown extern function getopt [2023-02-15 22:34:49,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:34:49,894 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:34:49,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49 WrapperNode [2023-02-15 22:34:49,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:34:49,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:34:49,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:34:49,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:34:49,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:49,947 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:49,988 INFO L138 Inliner]: procedures = 352, calls = 112, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 367 [2023-02-15 22:34:49,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:34:49,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:34:49,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:34:49,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:34:50,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,051 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,066 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:34:50,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:34:50,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:34:50,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:34:50,082 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (1/1) ... [2023-02-15 22:34:50,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:34:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:34:50,114 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 22:34:50,133 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 22:34:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-15 22:34:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 22:34:50,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 22:34:50,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 22:34:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:34:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-15 22:34:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:34:50,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:34:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:34:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2023-02-15 22:34:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:34:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:34:50,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:34:50,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:34:50,541 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:34:50,544 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:34:51,703 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:34:51,711 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:34:51,712 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2023-02-15 22:34:51,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:34:51 BoogieIcfgContainer [2023-02-15 22:34:51,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:34:51,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:34:51,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:34:51,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:34:51,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:34:48" (1/3) ... [2023-02-15 22:34:51,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61039a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:34:51, skipping insertion in model container [2023-02-15 22:34:51,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:34:49" (2/3) ... [2023-02-15 22:34:51,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61039a88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:34:51, skipping insertion in model container [2023-02-15 22:34:51,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:34:51" (3/3) ... [2023-02-15 22:34:51,721 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-1.i [2023-02-15 22:34:51,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:34:51,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-15 22:34:51,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:34:51,785 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;@192ebc48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:34:51,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-15 22:34:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 142 states have (on average 1.9366197183098592) internal successors, (275), 234 states have internal predecessors, (275), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:34:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:34:51,799 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:34:51,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:34:51,801 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:34:51,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:34:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 22:34:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:34:51,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044203940] [2023-02-15 22:34:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:34:51,824 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 22:34:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:34:51,831 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 22:34:51,839 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 22:34:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:34:52,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:34:52,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:34:52,067 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 22:34:52,079 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 22:34:52,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:34:52,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:34:52,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044203940] [2023-02-15 22:34:52,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044203940] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:34:52,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:34:52,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:34:52,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535750177] [2023-02-15 22:34:52,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:34:52,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:34:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:34:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:34:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:34:52,130 INFO L87 Difference]: Start difference. First operand has 238 states, 142 states have (on average 1.9366197183098592) internal successors, (275), 234 states have internal predecessors, (275), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 22:34:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:34:52,635 INFO L93 Difference]: Finished difference Result 248 states and 279 transitions. [2023-02-15 22:34:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:34:52,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-02-15 22:34:52,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:34:52,648 INFO L225 Difference]: With dead ends: 248 [2023-02-15 22:34:52,648 INFO L226 Difference]: Without dead ends: 246 [2023-02-15 22:34:52,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:34:52,652 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 233 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:34:52,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 201 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:34:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-15 22:34:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 230. [2023-02-15 22:34:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 139 states have (on average 1.841726618705036) internal successors, (256), 226 states have internal predecessors, (256), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:34:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 260 transitions. [2023-02-15 22:34:52,721 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 260 transitions. Word has length 3 [2023-02-15 22:34:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:34:52,721 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 260 transitions. [2023-02-15 22:34:52,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 22:34:52,722 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 260 transitions. [2023-02-15 22:34:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 22:34:52,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:34:52,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 22:34:52,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:34:52,934 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 22:34:52,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:34:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:34:52,935 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 22:34:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:34:52,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897773612] [2023-02-15 22:34:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:34:52,937 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 22:34:52,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:34:52,939 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 22:34:52,942 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 22:34:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:34:53,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:34:53,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:34:53,080 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 22:34:53,095 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 22:34:53,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:34:53,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:34:53,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897773612] [2023-02-15 22:34:53,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897773612] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:34:53,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:34:53,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:34:53,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718002760] [2023-02-15 22:34:53,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:34:53,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:34:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:34:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:34:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:34:53,102 INFO L87 Difference]: Start difference. First operand 230 states and 260 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 22:34:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:34:53,830 INFO L93 Difference]: Finished difference Result 229 states and 259 transitions. [2023-02-15 22:34:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:34:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-02-15 22:34:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:34:53,832 INFO L225 Difference]: With dead ends: 229 [2023-02-15 22:34:53,832 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 22:34:53,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:34:53,833 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 9 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:34:53,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 420 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:34:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 22:34:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2023-02-15 22:34:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 139 states have (on average 1.8345323741007193) internal successors, (255), 225 states have internal predecessors, (255), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:34:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 259 transitions. [2023-02-15 22:34:53,843 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 259 transitions. Word has length 3 [2023-02-15 22:34:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:34:53,843 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 259 transitions. [2023-02-15 22:34:53,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states 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 22:34:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 259 transitions. [2023-02-15 22:34:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:34:53,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:34:53,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:34:53,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:34:54,044 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 22:34:54,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:34:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:34:54,046 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2023-02-15 22:34:54,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:34:54,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359710665] [2023-02-15 22:34:54,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:34:54,047 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 22:34:54,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:34:54,048 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 22:34:54,051 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 22:34:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:34:54,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:34:54,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:34:54,180 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 22:34:54,235 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 22:34:54,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:34:54,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:34:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359710665] [2023-02-15 22:34:54,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359710665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:34:54,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:34:54,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:34:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469041082] [2023-02-15 22:34:54,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:34:54,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:34:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:34:54,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:34:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:34:54,238 INFO L87 Difference]: Start difference. First operand 229 states and 259 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 22:34:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:34:55,023 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2023-02-15 22:34:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:34:55,024 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 22:34:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:34:55,026 INFO L225 Difference]: With dead ends: 233 [2023-02-15 22:34:55,026 INFO L226 Difference]: Without dead ends: 233 [2023-02-15 22:34:55,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:34:55,027 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 10 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:34:55,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 585 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:34:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-15 22:34:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2023-02-15 22:34:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 141 states have (on average 1.822695035460993) internal successors, (257), 227 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:34:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 261 transitions. [2023-02-15 22:34:55,045 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 261 transitions. Word has length 6 [2023-02-15 22:34:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:34:55,045 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 261 transitions. [2023-02-15 22:34:55,045 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 22:34:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 261 transitions. [2023-02-15 22:34:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:34:55,046 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:34:55,046 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:34:55,060 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 22:34:55,258 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 22:34:55,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:34:55,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:34:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2023-02-15 22:34:55,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:34:55,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671985980] [2023-02-15 22:34:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:34:55,260 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 22:34:55,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:34:55,261 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 22:34:55,264 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 22:34:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:34:55,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:34:55,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:34:55,407 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 22:34:55,519 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 22:34:55,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:34:56,098 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 22:34:56,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:34:56,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671985980] [2023-02-15 22:34:56,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671985980] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:34:56,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:34:56,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-15 22:34:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142094135] [2023-02-15 22:34:56,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:34:56,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:34:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:34:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:34:56,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:34:56,101 INFO L87 Difference]: Start difference. First operand 231 states and 261 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 22:34:58,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:34:58,963 INFO L93 Difference]: Finished difference Result 237 states and 267 transitions. [2023-02-15 22:34:58,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:34:58,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 10 [2023-02-15 22:34:58,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:34:58,966 INFO L225 Difference]: With dead ends: 237 [2023-02-15 22:34:58,966 INFO L226 Difference]: Without dead ends: 237 [2023-02-15 22:34:58,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:34:58,970 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 24 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:34:58,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 752 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-15 22:34:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-15 22:34:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2023-02-15 22:34:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 148 states have (on average 1.777027027027027) internal successors, (263), 233 states have internal predecessors, (263), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:34:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2023-02-15 22:34:58,986 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 10 [2023-02-15 22:34:58,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:34:58,989 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2023-02-15 22:34:58,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 22:34:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2023-02-15 22:34:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:34:58,991 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:34:58,991 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:34:59,007 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 22:34:59,204 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 22:34:59,204 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:34:59,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:34:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1887063184, now seen corresponding path program 1 times [2023-02-15 22:34:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:34:59,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148176785] [2023-02-15 22:34:59,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:34:59,206 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 22:34:59,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:34:59,207 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 22:34:59,208 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 22:34:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:34:59,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:34:59,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:34:59,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:34:59,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:34:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:34:59,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:34:59,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148176785] [2023-02-15 22:34:59,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148176785] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:34:59,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:34:59,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 22:34:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137349569] [2023-02-15 22:34:59,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:34:59,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:34:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:34:59,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:34:59,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:34:59,537 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:34:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:34:59,805 INFO L93 Difference]: Finished difference Result 257 states and 287 transitions. [2023-02-15 22:34:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:34:59,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-15 22:34:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:34:59,808 INFO L225 Difference]: With dead ends: 257 [2023-02-15 22:34:59,808 INFO L226 Difference]: Without dead ends: 257 [2023-02-15 22:34:59,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:34:59,811 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 18 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:34:59,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1277 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:34:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-15 22:34:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2023-02-15 22:34:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 168 states have (on average 1.6845238095238095) internal successors, (283), 253 states have internal predecessors, (283), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:34:59,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 287 transitions. [2023-02-15 22:34:59,819 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 287 transitions. Word has length 25 [2023-02-15 22:34:59,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:34:59,820 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 287 transitions. [2023-02-15 22:34:59,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:34:59,820 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 287 transitions. [2023-02-15 22:34:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:34:59,825 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:34:59,825 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:34:59,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:00,043 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 22:35:00,044 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1620022495, now seen corresponding path program 2 times [2023-02-15 22:35:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:00,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153188444] [2023-02-15 22:35:00,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:35:00,046 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 22:35:00,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:00,047 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 22:35:00,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:35:00,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:35:00,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:35:00,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:35:00,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:00,209 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:35:00,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 22:35:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-15 22:35:00,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:00,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:00,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153188444] [2023-02-15 22:35:00,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153188444] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:00,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:00,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:35:00,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181575204] [2023-02-15 22:35:00,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:00,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:35:00,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:00,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:35:00,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:35:00,249 INFO L87 Difference]: Start difference. First operand 257 states and 287 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:00,637 INFO L93 Difference]: Finished difference Result 268 states and 299 transitions. [2023-02-15 22:35:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:35:00,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2023-02-15 22:35:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:00,639 INFO L225 Difference]: With dead ends: 268 [2023-02-15 22:35:00,639 INFO L226 Difference]: Without dead ends: 268 [2023-02-15 22:35:00,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 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 22:35:00,640 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 218 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:00,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 204 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:35:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-15 22:35:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 252. [2023-02-15 22:35:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 168 states have (on average 1.6547619047619047) internal successors, (278), 248 states have internal predecessors, (278), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2023-02-15 22:35:00,645 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 45 [2023-02-15 22:35:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:00,646 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2023-02-15 22:35:00,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2023-02-15 22:35:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:35:00,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:00,647 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:00,662 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 22:35:00,848 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 22:35:00,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:00,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:00,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1620022494, now seen corresponding path program 1 times [2023-02-15 22:35:00,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:00,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803585699] [2023-02-15 22:35:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:00,849 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 22:35:00,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:00,851 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 22:35:00,852 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 22:35:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:01,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:35:01,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:01,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:35:01,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:01,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803585699] [2023-02-15 22:35:01,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803585699] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:01,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:01,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 22:35:01,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376915102] [2023-02-15 22:35:01,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:01,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:35:01,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:01,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:35:01,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:35:01,449 INFO L87 Difference]: Start difference. First operand 252 states and 282 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:35:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:01,920 INFO L93 Difference]: Finished difference Result 260 states and 290 transitions. [2023-02-15 22:35:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:35:01,921 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2023-02-15 22:35:01,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:01,922 INFO L225 Difference]: With dead ends: 260 [2023-02-15 22:35:01,922 INFO L226 Difference]: Without dead ends: 260 [2023-02-15 22:35:01,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:35:01,923 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 9 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3291 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:01,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3291 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:35:01,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-15 22:35:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2023-02-15 22:35:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 176 states have (on average 1.625) internal successors, (286), 256 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 290 transitions. [2023-02-15 22:35:01,929 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 290 transitions. Word has length 45 [2023-02-15 22:35:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:01,929 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 290 transitions. [2023-02-15 22:35:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:35:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 290 transitions. [2023-02-15 22:35:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:35:01,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:01,931 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:01,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-15 22:35:02,145 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 22:35:02,146 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 501144028, now seen corresponding path program 2 times [2023-02-15 22:35:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:02,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452419661] [2023-02-15 22:35:02,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:35:02,147 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 22:35:02,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:02,148 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 22:35:02,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 (9)] Waiting until timeout for monitored process [2023-02-15 22:35:02,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:35:02,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:35:02,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:35:02,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:02,384 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:35:02,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 22:35:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:02,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:02,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:02,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452419661] [2023-02-15 22:35:02,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452419661] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:02,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:02,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:35:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019335180] [2023-02-15 22:35:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:02,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:35:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:02,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:35:02,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:35:02,480 INFO L87 Difference]: Start difference. First operand 260 states and 290 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:03,683 INFO L93 Difference]: Finished difference Result 439 states and 497 transitions. [2023-02-15 22:35:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:35:03,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-15 22:35:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:03,686 INFO L225 Difference]: With dead ends: 439 [2023-02-15 22:35:03,686 INFO L226 Difference]: Without dead ends: 439 [2023-02-15 22:35:03,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:35:03,687 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 632 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:03,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 748 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 22:35:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2023-02-15 22:35:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 363. [2023-02-15 22:35:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 279 states have (on average 1.7168458781362008) internal successors, (479), 358 states have internal predecessors, (479), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:35:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 485 transitions. [2023-02-15 22:35:03,696 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 485 transitions. Word has length 53 [2023-02-15 22:35:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:03,697 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 485 transitions. [2023-02-15 22:35:03,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2023-02-15 22:35:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:35:03,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:03,698 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:03,710 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 22:35:03,905 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 22:35:03,905 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash 275387719, now seen corresponding path program 1 times [2023-02-15 22:35:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:03,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531575315] [2023-02-15 22:35:03,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:03,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 22:35:03,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:03,908 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 22:35:03,911 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 22:35:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:04,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:35:04,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:04,334 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:35:04,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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 22:35:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:35:04,715 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:35:04,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2023-02-15 22:35:04,735 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:04,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:04,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:04,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:04,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531575315] [2023-02-15 22:35:04,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531575315] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:04,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:04,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:35:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409018621] [2023-02-15 22:35:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:04,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:35:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:04,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:35:04,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:35:04,854 INFO L87 Difference]: Start difference. First operand 363 states and 485 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:10,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:35:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:10,849 INFO L93 Difference]: Finished difference Result 332 states and 366 transitions. [2023-02-15 22:35:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:35:10,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-02-15 22:35:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:10,853 INFO L225 Difference]: With dead ends: 332 [2023-02-15 22:35:10,853 INFO L226 Difference]: Without dead ends: 332 [2023-02-15 22:35:10,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:35:10,854 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 782 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:10,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 633 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 669 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-02-15 22:35:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-15 22:35:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 287. [2023-02-15 22:35:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 204 states have (on average 1.6176470588235294) internal successors, (330), 283 states have internal predecessors, (330), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 334 transitions. [2023-02-15 22:35:10,863 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 334 transitions. Word has length 56 [2023-02-15 22:35:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:10,863 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 334 transitions. [2023-02-15 22:35:10,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 334 transitions. [2023-02-15 22:35:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:35:10,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:10,865 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:10,882 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 22:35:11,081 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 22:35:11,081 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash 687983530, now seen corresponding path program 1 times [2023-02-15 22:35:11,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:11,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374284410] [2023-02-15 22:35:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:11,082 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 22:35:11,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:11,084 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 22:35:11,085 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 22:35:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:11,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:35:11,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:11,574 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 22:35:11,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 22:35:11,596 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:35:11,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-02-15 22:35:11,846 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:35:11,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2023-02-15 22:35:11,877 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:11,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:12,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:12,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:12,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374284410] [2023-02-15 22:35:12,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374284410] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:12,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:12,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:35:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180431218] [2023-02-15 22:35:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:12,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:35:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:12,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:35:12,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:35:12,114 INFO L87 Difference]: Start difference. First operand 287 states and 334 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:16,364 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2023-02-15 22:35:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:35:16,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-02-15 22:35:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:16,366 INFO L225 Difference]: With dead ends: 312 [2023-02-15 22:35:16,366 INFO L226 Difference]: Without dead ends: 312 [2023-02-15 22:35:16,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:35:16,367 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 501 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:16,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 760 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-02-15 22:35:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-02-15 22:35:16,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 296. [2023-02-15 22:35:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 214 states have (on average 1.602803738317757) internal successors, (343), 292 states have internal predecessors, (343), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 347 transitions. [2023-02-15 22:35:16,374 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 347 transitions. Word has length 59 [2023-02-15 22:35:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:16,374 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 347 transitions. [2023-02-15 22:35:16,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 347 transitions. [2023-02-15 22:35:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:35:16,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:16,375 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:16,395 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 22:35:16,592 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 22:35:16,593 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:16,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 133394829, now seen corresponding path program 1 times [2023-02-15 22:35:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:16,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359180465] [2023-02-15 22:35:16,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:16,594 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 22:35:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:16,595 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 22:35:16,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 22:35:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:16,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:35:16,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:17,003 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 22:35:17,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:17,140 INFO L321 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2023-02-15 22:35:17,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2023-02-15 22:35:17,228 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:35:17,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 14 [2023-02-15 22:35:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:17,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:17,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:17,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359180465] [2023-02-15 22:35:17,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359180465] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:17,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:17,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:35:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535877924] [2023-02-15 22:35:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:17,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:35:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:35:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:35:17,252 INFO L87 Difference]: Start difference. First operand 296 states and 347 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:18,539 INFO L93 Difference]: Finished difference Result 293 states and 342 transitions. [2023-02-15 22:35:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:35:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-02-15 22:35:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:18,540 INFO L225 Difference]: With dead ends: 293 [2023-02-15 22:35:18,540 INFO L226 Difference]: Without dead ends: 293 [2023-02-15 22:35:18,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:35:18,541 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 227 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:18,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 859 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 22:35:18,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-02-15 22:35:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 274. [2023-02-15 22:35:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 195 states have (on average 1.5743589743589743) internal successors, (307), 270 states have internal predecessors, (307), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2023-02-15 22:35:18,547 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 62 [2023-02-15 22:35:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:18,547 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2023-02-15 22:35:18,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:18,547 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2023-02-15 22:35:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:35:18,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:18,548 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:18,566 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 22:35:18,766 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 22:35:18,766 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 133394830, now seen corresponding path program 1 times [2023-02-15 22:35:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:18,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092139051] [2023-02-15 22:35:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:18,767 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 22:35:18,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:18,770 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 22:35:18,773 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 22:35:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:19,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:35:19,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:19,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 22:35:19,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:35:19,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:19,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:19,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 22:35:19,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 22:35:19,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-15 22:35:19,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2023-02-15 22:35:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:19,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:19,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:19,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092139051] [2023-02-15 22:35:19,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092139051] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:19,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:19,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:35:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794914596] [2023-02-15 22:35:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:19,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:35:19,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:35:19,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:35:19,385 INFO L87 Difference]: Start difference. First operand 274 states and 311 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:20,392 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2023-02-15 22:35:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:35:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2023-02-15 22:35:20,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:20,395 INFO L225 Difference]: With dead ends: 273 [2023-02-15 22:35:20,395 INFO L226 Difference]: Without dead ends: 273 [2023-02-15 22:35:20,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:35:20,396 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 228 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:20,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 711 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 22:35:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-02-15 22:35:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2023-02-15 22:35:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 195 states have (on average 1.564102564102564) internal successors, (305), 269 states have internal predecessors, (305), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 309 transitions. [2023-02-15 22:35:20,407 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 309 transitions. Word has length 62 [2023-02-15 22:35:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:20,408 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 309 transitions. [2023-02-15 22:35:20,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 309 transitions. [2023-02-15 22:35:20,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:35:20,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:20,411 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:20,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:20,625 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 22:35:20,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash 379730104, now seen corresponding path program 1 times [2023-02-15 22:35:20,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:20,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358280030] [2023-02-15 22:35:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:20,627 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 22:35:20,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:20,628 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 22:35:20,629 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 22:35:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:21,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:35:21,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:21,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 22:35:21,207 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:35:21,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 22:35:21,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:21,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2023-02-15 22:35:21,477 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:21,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 22:35:21,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-02-15 22:35:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:21,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:21,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358280030] [2023-02-15 22:35:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358280030] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:21,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:21,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:35:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588405278] [2023-02-15 22:35:21,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:21,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:35:21,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:35:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:35:21,598 INFO L87 Difference]: Start difference. First operand 273 states and 309 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:23,181 INFO L93 Difference]: Finished difference Result 296 states and 333 transitions. [2023-02-15 22:35:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:35:23,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2023-02-15 22:35:23,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:23,183 INFO L225 Difference]: With dead ends: 296 [2023-02-15 22:35:23,183 INFO L226 Difference]: Without dead ends: 296 [2023-02-15 22:35:23,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:35:23,185 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 487 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:23,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 632 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 22:35:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-15 22:35:23,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 282. [2023-02-15 22:35:23,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 204 states have (on average 1.5686274509803921) internal successors, (320), 278 states have internal predecessors, (320), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:23,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 324 transitions. [2023-02-15 22:35:23,190 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 324 transitions. Word has length 66 [2023-02-15 22:35:23,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:23,191 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 324 transitions. [2023-02-15 22:35:23,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 324 transitions. [2023-02-15 22:35:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:35:23,192 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:23,192 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:23,210 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 (14)] Ended with exit code 0 [2023-02-15 22:35:23,410 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 22:35:23,410 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash 379730105, now seen corresponding path program 1 times [2023-02-15 22:35:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:23,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203512237] [2023-02-15 22:35:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:23,411 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 22:35:23,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:23,412 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 22:35:23,414 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 22:35:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:23,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 22:35:23,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:23,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 22:35:23,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 6 treesize of output 5 [2023-02-15 22:35:23,919 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:23,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:23,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:23,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:24,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2023-02-15 22:35:24,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 22:35:24,206 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:24,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2023-02-15 22:35:24,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:35:24,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-02-15 22:35:24,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-15 22:35:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 22:35:24,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:35:24,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:24,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203512237] [2023-02-15 22:35:24,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203512237] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:35:24,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:35:24,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:35:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084143388] [2023-02-15 22:35:24,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:35:24,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:35:24,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:35:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:35:24,335 INFO L87 Difference]: Start difference. First operand 282 states and 324 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:26,046 INFO L93 Difference]: Finished difference Result 294 states and 328 transitions. [2023-02-15 22:35:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:35:26,047 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2023-02-15 22:35:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:26,048 INFO L225 Difference]: With dead ends: 294 [2023-02-15 22:35:26,048 INFO L226 Difference]: Without dead ends: 294 [2023-02-15 22:35:26,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 22:35:26,049 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 466 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:26,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 655 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-02-15 22:35:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-02-15 22:35:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 282. [2023-02-15 22:35:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 204 states have (on average 1.5490196078431373) internal successors, (316), 278 states have internal predecessors, (316), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2023-02-15 22:35:26,054 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 66 [2023-02-15 22:35:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:26,054 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2023-02-15 22:35:26,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2023-02-15 22:35:26,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 22:35:26,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:26,056 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:26,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:35:26,269 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 22:35:26,269 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:26,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1974317589, now seen corresponding path program 1 times [2023-02-15 22:35:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:26,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586503488] [2023-02-15 22:35:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:26,270 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 22:35:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:26,271 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 22:35:26,272 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 22:35:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:26,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:35:26,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:26,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 22:35:26,839 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 22:35:26,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 22:35:26,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:26,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2023-02-15 22:35:27,050 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:27,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 22:35:27,165 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:27,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 22:35:27,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-02-15 22:35:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-02-15 22:35:27,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:29,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_979) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-15 22:35:29,595 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_978 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_978))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_979)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 22:35:29,618 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_978 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_978))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_979)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 22:35:29,657 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_979 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_978 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_977))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_978)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_979)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-02-15 22:35:29,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:35:29,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2023-02-15 22:35:29,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1641 treesize of output 1299 [2023-02-15 22:35:29,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1295 treesize of output 1057 [2023-02-15 22:35:29,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1057 treesize of output 798 [2023-02-15 22:35:29,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 798 treesize of output 770 [2023-02-15 22:35:33,422 INFO L321 Elim1Store]: treesize reduction 24, result has 22.6 percent of original size [2023-02-15 22:35:33,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 30 [2023-02-15 22:35:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2023-02-15 22:35:33,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:35:33,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586503488] [2023-02-15 22:35:33,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586503488] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:35:33,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:35:33,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-02-15 22:35:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663628335] [2023-02-15 22:35:33,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:35:33,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:35:33,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:35:33,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:35:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=163, Unknown=8, NotChecked=116, Total=342 [2023-02-15 22:35:33,436 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:35:36,615 INFO L93 Difference]: Finished difference Result 290 states and 324 transitions. [2023-02-15 22:35:36,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:35:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2023-02-15 22:35:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:35:36,617 INFO L225 Difference]: With dead ends: 290 [2023-02-15 22:35:36,617 INFO L226 Difference]: Without dead ends: 290 [2023-02-15 22:35:36,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 122 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=86, Invalid=228, Unknown=8, NotChecked=140, Total=462 [2023-02-15 22:35:36,618 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 437 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 931 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:35:36,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1291 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 759 Invalid, 0 Unknown, 931 Unchecked, 2.4s Time] [2023-02-15 22:35:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-15 22:35:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 281. [2023-02-15 22:35:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 204 states have (on average 1.5392156862745099) internal successors, (314), 277 states have internal predecessors, (314), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 22:35:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 318 transitions. [2023-02-15 22:35:36,623 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 318 transitions. Word has length 71 [2023-02-15 22:35:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:35:36,624 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 318 transitions. [2023-02-15 22:35:36,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:35:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 318 transitions. [2023-02-15 22:35:36,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 22:35:36,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:35:36,625 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:35:36,645 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 22:35:36,843 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 22:35:36,844 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:35:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:35:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1974317588, now seen corresponding path program 1 times [2023-02-15 22:35:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:35:36,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892094318] [2023-02-15 22:35:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:35:36,845 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 22:35:36,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:35:36,846 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 22:35:36,847 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 22:35:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:35:37,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:35:37,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:35:37,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 22:35:37,454 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 22:35:37,471 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:35:37,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:35:37,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:37,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-02-15 22:35:37,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2023-02-15 22:35:37,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 22:35:37,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:37,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2023-02-15 22:35:37,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:35:37,950 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:35:37,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2023-02-15 22:35:37,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 22:35:38,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-02-15 22:35:38,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-02-15 22:35:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-15 22:35:38,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:35:39,176 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem124#1.base| v_ArrVal_1097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2023-02-15 22:35:39,279 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-02-15 22:35:39,381 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))) is different from false [2023-02-15 22:35:39,476 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1094))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1095) .cse0 v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) .cse2 (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_1097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1095) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem122#1.base| v_ArrVal_1094) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse4 .cse2) (bvadd .cse4 .cse2 (_ bv1 64))))))) is different from false [2023-02-15 22:35:39,756 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1094))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1095) .cse2 v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1095) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1094) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 .cse5 (_ bv1 64)))))))) is different from false [2023-02-15 22:35:40,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|) (_ bv8 64)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1097 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1092))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_1094))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1093) .cse0 v_ArrVal_1095) .cse1 v_ArrVal_1096) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse3 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1097) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1093 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1092 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1095 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1094 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1096 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1092))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1093) .cse7 v_ArrVal_1095) (select (select (store .cse8 .cse7 v_ArrVal_1094) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1096))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse6 .cse3) (bvadd .cse6 .cse3 (_ bv1 64))))))) is different from false [2023-02-15 22:35:40,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:35:40,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-02-15 22:35:40,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:35:40,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-02-15 22:35:40,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20775 treesize of output 17130 [2023-02-15 22:35:40,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 373331 treesize of output 361514 [2023-02-15 22:35:42,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 361510 treesize of output 326566 [2023-02-15 22:35:42,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326566 treesize of output 309990 [2023-02-15 22:35:43,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 309990 treesize of output 300806 [2023-02-15 22:35:43,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 300806 treesize of output 269082 [2023-02-15 22:35:44,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 269082 treesize of output 234138 [2023-02-15 22:35:45,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 234138 treesize of output 191914