./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20020406-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/memsafety/20020406-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:50:11,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:50:11,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:50:12,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:50:12,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:50:12,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:50:12,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:50:12,019 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:50:12,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:50:12,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:50:12,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:50:12,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:50:12,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:50:12,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:50:12,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:50:12,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:50:12,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:50:12,036 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:50:12,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:50:12,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:50:12,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:50:12,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:50:12,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:50:12,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:50:12,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:50:12,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:50:12,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:50:12,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:50:12,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:50:12,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:50:12,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:50:12,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:50:12,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:50:12,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:50:12,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:50:12,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:50:12,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:50:12,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:50:12,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:50:12,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:50:12,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:50:12,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:50:12,089 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:50:12,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:50:12,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:50:12,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:50:12,090 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:50:12,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:50:12,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:50:12,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:50:12,091 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:50:12,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:50:12,092 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:50:12,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:50:12,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:50:12,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:50:12,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:50:12,093 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:50:12,093 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:50:12,093 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:50:12,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:50:12,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:50:12,094 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:50:12,094 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:50:12,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:50:12,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:50:12,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:50:12,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:50:12,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:50:12,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:50:12,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:50:12,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:50:12,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:50:12,096 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:50:12,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:50:12,096 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:50:12,096 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2023-02-15 21:50:12,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:50:12,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:50:12,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:50:12,333 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:50:12,333 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:50:12,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 21:50:13,351 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:50:13,583 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:50:13,583 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 21:50:13,598 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ae81dcd/e4d59aaf6811490da68202f403afcf30/FLAGdca9a3585 [2023-02-15 21:50:13,617 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ae81dcd/e4d59aaf6811490da68202f403afcf30 [2023-02-15 21:50:13,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:50:13,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:50:13,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:13,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:50:13,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:50:13,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:13" (1/1) ... [2023-02-15 21:50:13,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a922ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:13, skipping insertion in model container [2023-02-15 21:50:13,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:13" (1/1) ... [2023-02-15 21:50:13,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:50:13,675 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:50:13,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:14,004 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-15 21:50:14,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f1433bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:14, skipping insertion in model container [2023-02-15 21:50:14,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:14,006 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 21:50:14,008 INFO L158 Benchmark]: Toolchain (without parser) took 386.79ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 104.8MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 21:50:14,008 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory was 89.7MB in the beginning and 89.7MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:50:14,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.13ms. Allocated memory is still 157.3MB. Free memory was 119.3MB in the beginning and 104.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 21:50:14,011 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.16ms. Allocated memory is still 123.7MB. Free memory was 89.7MB in the beginning and 89.7MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.13ms. Allocated memory is still 157.3MB. Free memory was 119.3MB in the beginning and 104.8MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 897]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20020406-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:50:15,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:50:15,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:50:15,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:50:15,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:50:15,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:50:15,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:50:15,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:50:15,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:50:15,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:50:15,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:50:15,635 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:50:15,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:50:15,637 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:50:15,638 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:50:15,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:50:15,640 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:50:15,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:50:15,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:50:15,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:50:15,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:50:15,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:50:15,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:50:15,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:50:15,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:50:15,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:50:15,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:50:15,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:50:15,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:50:15,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:50:15,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:50:15,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:50:15,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:50:15,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:50:15,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:50:15,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:50:15,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:50:15,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:50:15,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:50:15,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:50:15,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:50:15,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 21:50:15,708 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:50:15,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:50:15,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:50:15,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:50:15,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:50:15,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:50:15,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:50:15,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:50:15,711 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:50:15,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:50:15,712 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:50:15,712 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:50:15,712 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:50:15,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:50:15,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:50:15,713 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:50:15,713 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:50:15,713 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:50:15,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:50:15,713 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:50:15,714 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 21:50:15,714 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 21:50:15,714 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:50:15,714 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:50:15,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:50:15,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:50:15,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:50:15,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:50:15,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:50:15,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:50:15,715 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 21:50:15,715 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 21:50:15,715 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:50:15,716 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:50:15,716 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:50:15,716 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 21:50:15,716 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:50:15,716 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ecdf6fdf9ec72145fabb79894bcc278b3e5646bc4893dbabc4bb180fa53c5ae [2023-02-15 21:50:15,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:50:16,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:50:16,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:50:16,011 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:50:16,011 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:50:16,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 21:50:16,977 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:50:17,249 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:50:17,250 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20020406-1.i [2023-02-15 21:50:17,268 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ec232f7/ebbfaee1d13b44e88dc6993053af2eb2/FLAGff8434393 [2023-02-15 21:50:17,282 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69ec232f7/ebbfaee1d13b44e88dc6993053af2eb2 [2023-02-15 21:50:17,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:50:17,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:50:17,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:17,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:50:17,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:50:17,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286057e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17, skipping insertion in model container [2023-02-15 21:50:17,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:50:17,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:50:17,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:17,721 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 21:50:17,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:50:17,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:17,820 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:50:17,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:50:17,905 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:50:17,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17 WrapperNode [2023-02-15 21:50:17,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:50:17,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:50:17,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:50:17,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:50:17,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,966 INFO L138 Inliner]: procedures = 286, calls = 76, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-02-15 21:50:17,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:50:17,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:50:17,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:50:17,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:50:17,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:17,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:18,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:18,017 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:18,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:18,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:50:18,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:50:18,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:50:18,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:50:18,023 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (1/1) ... [2023-02-15 21:50:18,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:50:18,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:50:18,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 21:50:18,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 21:50:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFdeg [2023-02-15 21:50:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFdeg [2023-02-15 21:50:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 21:50:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 21:50:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 21:50:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFnew [2023-02-15 21:50:18,091 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFnew [2023-02-15 21:50:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFfree [2023-02-15 21:50:18,091 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFfree [2023-02-15 21:50:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFshift_add [2023-02-15 21:50:18,091 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFshift_add [2023-02-15 21:50:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:50:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 21:50:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 21:50:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure FFmul [2023-02-15 21:50:18,092 INFO L138 BoogieDeclarations]: Found implementation of procedure FFmul [2023-02-15 21:50:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFexgcd [2023-02-15 21:50:18,092 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFexgcd [2023-02-15 21:50:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:50:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:50:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 21:50:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFswap [2023-02-15 21:50:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFswap [2023-02-15 21:50:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure DUPFFcopy [2023-02-15 21:50:18,094 INFO L138 BoogieDeclarations]: Found implementation of procedure DUPFFcopy [2023-02-15 21:50:18,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:50:18,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:50:18,246 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:50:18,247 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:50:18,810 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:50:18,821 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:50:18,821 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 21:50:18,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:18 BoogieIcfgContainer [2023-02-15 21:50:18,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:50:18,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:50:18,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:50:18,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:50:18,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:50:17" (1/3) ... [2023-02-15 21:50:18,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218ef0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:50:18, skipping insertion in model container [2023-02-15 21:50:18,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:50:17" (2/3) ... [2023-02-15 21:50:18,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218ef0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:50:18, skipping insertion in model container [2023-02-15 21:50:18,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:50:18" (3/3) ... [2023-02-15 21:50:18,831 INFO L112 eAbstractionObserver]: Analyzing ICFG 20020406-1.i [2023-02-15 21:50:18,842 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:50:18,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2023-02-15 21:50:18,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:50:18,883 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;@c505412, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:50:18,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2023-02-15 21:50:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:50:18,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 21:50:18,891 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:18,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 21:50:18,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:18,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash 228226931, now seen corresponding path program 1 times [2023-02-15 21:50:18,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:18,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444806155] [2023-02-15 21:50:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:18,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:18,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:18,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:18,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 21:50:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:19,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 21:50:19,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:19,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:50:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:19,064 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:19,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:19,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444806155] [2023-02-15 21:50:19,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444806155] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:19,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:19,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:50:19,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093788448] [2023-02-15 21:50:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:19,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:50:19,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:19,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:50:19,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:19,089 INFO L87 Difference]: Start difference. First operand has 187 states, 90 states have (on average 1.7333333333333334) internal successors, (156), 146 states have internal predecessors, (156), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:19,332 INFO L93 Difference]: Finished difference Result 182 states and 218 transitions. [2023-02-15 21:50:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:50:19,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 21:50:19,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:19,341 INFO L225 Difference]: With dead ends: 182 [2023-02-15 21:50:19,342 INFO L226 Difference]: Without dead ends: 180 [2023-02-15 21:50:19,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:19,347 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 22 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:19,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 344 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:50:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-02-15 21:50:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-02-15 21:50:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 87 states have (on average 1.6781609195402298) internal successors, (146), 139 states have internal predecessors, (146), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:50:19,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 216 transitions. [2023-02-15 21:50:19,388 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 216 transitions. Word has length 5 [2023-02-15 21:50:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:19,389 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 216 transitions. [2023-02-15 21:50:19,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 216 transitions. [2023-02-15 21:50:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 21:50:19,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:19,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 21:50:19,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 21:50:19,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:19,591 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:19,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 228226932, now seen corresponding path program 1 times [2023-02-15 21:50:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:19,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993536732] [2023-02-15 21:50:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:19,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:19,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:19,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:19,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 21:50:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:19,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 21:50:19,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:19,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:50:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:19,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:19,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993536732] [2023-02-15 21:50:19,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993536732] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:19,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:19,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:50:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625589796] [2023-02-15 21:50:19,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:19,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:50:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:50:19,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:19,684 INFO L87 Difference]: Start difference. First operand 180 states and 216 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:19,965 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2023-02-15 21:50:19,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:50:19,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 21:50:19,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:19,968 INFO L225 Difference]: With dead ends: 184 [2023-02-15 21:50:19,969 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 21:50:19,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:50:19,970 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 6 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:19,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:50:19,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 21:50:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2023-02-15 21:50:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 89 states have (on average 1.651685393258427) internal successors, (147), 140 states have internal predecessors, (147), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:50:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2023-02-15 21:50:19,985 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 5 [2023-02-15 21:50:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:19,987 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2023-02-15 21:50:19,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2023-02-15 21:50:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 21:50:19,988 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:19,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:19,997 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 21:50:20,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:20,189 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting DUPFFnewErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:20,189 INFO L85 PathProgramCache]: Analyzing trace with hash 282747829, now seen corresponding path program 1 times [2023-02-15 21:50:20,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:20,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715732637] [2023-02-15 21:50:20,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:20,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:20,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:20,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:20,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 21:50:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:20,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:50:20,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:20,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:50:20,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:50:20,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:20,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 21:50:20,423 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 21:50:20,423 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 21:50:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:20,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:20,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:20,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715732637] [2023-02-15 21:50:20,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715732637] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:20,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:20,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:50:20,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253720219] [2023-02-15 21:50:20,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:20,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:50:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:20,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:50:20,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:50:20,446 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:20,642 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2023-02-15 21:50:20,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:50:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 21:50:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:20,644 INFO L225 Difference]: With dead ends: 177 [2023-02-15 21:50:20,644 INFO L226 Difference]: Without dead ends: 177 [2023-02-15 21:50:20,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:50:20,645 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 32 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:20,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 342 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:50:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-15 21:50:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2023-02-15 21:50:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 134 states have internal predecessors, (141), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:50:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 211 transitions. [2023-02-15 21:50:20,653 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 211 transitions. Word has length 7 [2023-02-15 21:50:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:20,653 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 211 transitions. [2023-02-15 21:50:20,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 211 transitions. [2023-02-15 21:50:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 21:50:20,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:20,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:20,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:20,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:20,854 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting DUPFFnewErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:20,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1865414411, now seen corresponding path program 1 times [2023-02-15 21:50:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:20,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714732459] [2023-02-15 21:50:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:20,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:20,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:20,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:20,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 21:50:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:20,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 21:50:20,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:20,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:50:20,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:21,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 21:50:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:21,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:21,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:21,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714732459] [2023-02-15 21:50:21,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714732459] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:21,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:21,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:50:21,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43319727] [2023-02-15 21:50:21,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:21,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:50:21,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:21,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:50:21,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:50:21,045 INFO L87 Difference]: Start difference. First operand 175 states and 211 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:21,529 INFO L93 Difference]: Finished difference Result 186 states and 233 transitions. [2023-02-15 21:50:21,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 21:50:21,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 21:50:21,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:21,532 INFO L225 Difference]: With dead ends: 186 [2023-02-15 21:50:21,532 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 21:50:21,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:50:21,533 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 35 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:21,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 811 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:50:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 21:50:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 174. [2023-02-15 21:50:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 133 states have internal predecessors, (140), 35 states have call successors, (35), 8 states have call predecessors, (35), 8 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:50:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 210 transitions. [2023-02-15 21:50:21,541 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 210 transitions. Word has length 11 [2023-02-15 21:50:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:21,541 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 210 transitions. [2023-02-15 21:50:21,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 210 transitions. [2023-02-15 21:50:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 21:50:21,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:21,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:21,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:21,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:21,749 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1993271845, now seen corresponding path program 1 times [2023-02-15 21:50:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:21,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960540085] [2023-02-15 21:50:21,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:21,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:21,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:21,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 21:50:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:21,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 21:50:21,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:21,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 21:50:21,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:21,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:21,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 21:50:21,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 21:50:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:21,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:21,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:21,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960540085] [2023-02-15 21:50:21,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960540085] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:21,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:21,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:50:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010382137] [2023-02-15 21:50:21,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:21,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:50:21,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:21,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:50:21,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:50:21,978 INFO L87 Difference]: Start difference. First operand 174 states and 210 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:22,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:22,633 INFO L93 Difference]: Finished difference Result 197 states and 234 transitions. [2023-02-15 21:50:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:50:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 21:50:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:22,636 INFO L225 Difference]: With dead ends: 197 [2023-02-15 21:50:22,636 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 21:50:22,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:50:22,637 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 62 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:22,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1053 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 21:50:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 21:50:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2023-02-15 21:50:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 102 states have (on average 1.5294117647058822) internal successors, (156), 148 states have internal predecessors, (156), 35 states have call successors, (35), 9 states have call predecessors, (35), 9 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:50:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 226 transitions. [2023-02-15 21:50:22,647 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 226 transitions. Word has length 12 [2023-02-15 21:50:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:22,647 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 226 transitions. [2023-02-15 21:50:22,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:50:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 226 transitions. [2023-02-15 21:50:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:50:22,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:22,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:22,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:22,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:22,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:22,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:22,858 INFO L85 PathProgramCache]: Analyzing trace with hash 335042805, now seen corresponding path program 1 times [2023-02-15 21:50:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:22,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25589853] [2023-02-15 21:50:22,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:22,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:22,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:22,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 21:50:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:22,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 21:50:22,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:23,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:23,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:23,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:23,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25589853] [2023-02-15 21:50:23,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25589853] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:23,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:23,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:50:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087821225] [2023-02-15 21:50:23,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:23,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:50:23,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:23,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:50:23,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:50:23,011 INFO L87 Difference]: Start difference. First operand 190 states and 226 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:50:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:23,149 INFO L93 Difference]: Finished difference Result 209 states and 253 transitions. [2023-02-15 21:50:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:50:23,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-15 21:50:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:23,151 INFO L225 Difference]: With dead ends: 209 [2023-02-15 21:50:23,151 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 21:50:23,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:50:23,152 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 44 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:23,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 757 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:50:23,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 21:50:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 198. [2023-02-15 21:50:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 156 states have internal predecessors, (164), 35 states have call successors, (35), 9 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-15 21:50:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 238 transitions. [2023-02-15 21:50:23,158 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 238 transitions. Word has length 21 [2023-02-15 21:50:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:23,158 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 238 transitions. [2023-02-15 21:50:23,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:50:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 238 transitions. [2023-02-15 21:50:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 21:50:23,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:23,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:23,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:23,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:23,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash 370721495, now seen corresponding path program 1 times [2023-02-15 21:50:23,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:23,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032297943] [2023-02-15 21:50:23,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:23,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:23,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:23,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:23,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 21:50:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:23,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 21:50:23,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:23,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:50:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:23,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:23,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032297943] [2023-02-15 21:50:23,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032297943] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:50:23,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:50:23,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-15 21:50:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221021485] [2023-02-15 21:50:23,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:50:23,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:50:23,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:23,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:50:23,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:50:23,697 INFO L87 Difference]: Start difference. First operand 198 states and 238 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:50:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:24,138 INFO L93 Difference]: Finished difference Result 246 states and 304 transitions. [2023-02-15 21:50:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 21:50:24,138 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 21:50:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:24,139 INFO L225 Difference]: With dead ends: 246 [2023-02-15 21:50:24,140 INFO L226 Difference]: Without dead ends: 234 [2023-02-15 21:50:24,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2023-02-15 21:50:24,140 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 123 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:24,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1351 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:50:24,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-02-15 21:50:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 216. [2023-02-15 21:50:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 127 states have (on average 1.4960629921259843) internal successors, (190), 173 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-15 21:50:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 264 transitions. [2023-02-15 21:50:24,147 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 264 transitions. Word has length 22 [2023-02-15 21:50:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:24,147 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 264 transitions. [2023-02-15 21:50:24,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:50:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 264 transitions. [2023-02-15 21:50:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:50:24,148 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:24,148 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:24,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:24,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:24,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash -843792011, now seen corresponding path program 2 times [2023-02-15 21:50:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:24,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103552677] [2023-02-15 21:50:24,356 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:50:24,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:24,357 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:24,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 21:50:24,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 21:50:24,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:50:24,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 21:50:24,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 21:50:24,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:24,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:24,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103552677] [2023-02-15 21:50:24,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103552677] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:24,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:24,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:50:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801624760] [2023-02-15 21:50:24,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:24,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:50:24,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:24,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:50:24,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:50:24,486 INFO L87 Difference]: Start difference. First operand 216 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:50:24,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:24,846 INFO L93 Difference]: Finished difference Result 214 states and 262 transitions. [2023-02-15 21:50:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:50:24,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-02-15 21:50:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:24,848 INFO L225 Difference]: With dead ends: 214 [2023-02-15 21:50:24,849 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 21:50:24,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:50:24,849 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 22 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:24,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 756 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:50:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 21:50:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-02-15 21:50:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 171 states have internal predecessors, (188), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (39), 35 states have call predecessors, (39), 35 states have call successors, (39) [2023-02-15 21:50:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 262 transitions. [2023-02-15 21:50:24,855 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 262 transitions. Word has length 25 [2023-02-15 21:50:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:24,855 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 262 transitions. [2023-02-15 21:50:24,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:50:24,856 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 262 transitions. [2023-02-15 21:50:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:50:24,856 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:24,856 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:24,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-02-15 21:50:25,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:25,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:25,064 INFO L85 PathProgramCache]: Analyzing trace with hash -843792010, now seen corresponding path program 1 times [2023-02-15 21:50:25,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:25,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112676544] [2023-02-15 21:50:25,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:25,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:25,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:25,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:25,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 21:50:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:25,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:50:25,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:25,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:50:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:50:25,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:25,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112676544] [2023-02-15 21:50:25,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112676544] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:50:25,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:50:25,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-15 21:50:25,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199879406] [2023-02-15 21:50:25,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:50:25,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 21:50:25,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:25,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 21:50:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:50:25,588 INFO L87 Difference]: Start difference. First operand 214 states and 262 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:50:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:26,623 INFO L93 Difference]: Finished difference Result 285 states and 358 transitions. [2023-02-15 21:50:26,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 21:50:26,623 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-02-15 21:50:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:26,625 INFO L225 Difference]: With dead ends: 285 [2023-02-15 21:50:26,625 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 21:50:26,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1045, Unknown=0, NotChecked=0, Total=1482 [2023-02-15 21:50:26,626 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 165 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:26,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1817 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 21:50:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 21:50:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 222. [2023-02-15 21:50:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 179 states have internal predecessors, (193), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 21:50:26,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2023-02-15 21:50:26,633 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 25 [2023-02-15 21:50:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:26,633 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2023-02-15 21:50:26,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:50:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2023-02-15 21:50:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 21:50:26,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:26,634 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:26,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:26,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:26,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:26,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash 168356342, now seen corresponding path program 2 times [2023-02-15 21:50:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:26,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704512249] [2023-02-15 21:50:26,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:50:26,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:26,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:26,848 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:26,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 21:50:26,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 21:50:26,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:50:26,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:50:26,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 21:50:27,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:50:27,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:27,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704512249] [2023-02-15 21:50:27,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704512249] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:50:27,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:50:27,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:50:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122300081] [2023-02-15 21:50:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:50:27,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:50:27,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:27,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:50:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:50:27,086 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:50:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:27,512 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2023-02-15 21:50:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:50:27,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2023-02-15 21:50:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:27,513 INFO L225 Difference]: With dead ends: 220 [2023-02-15 21:50:27,514 INFO L226 Difference]: Without dead ends: 220 [2023-02-15 21:50:27,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:50:27,514 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 15 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:27,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 809 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:50:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-15 21:50:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2023-02-15 21:50:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 134 states have (on average 1.4253731343283582) internal successors, (191), 177 states have internal predecessors, (191), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 21:50:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 266 transitions. [2023-02-15 21:50:27,520 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 266 transitions. Word has length 29 [2023-02-15 21:50:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:27,520 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 266 transitions. [2023-02-15 21:50:27,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:50:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 266 transitions. [2023-02-15 21:50:27,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 21:50:27,521 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:27,521 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:27,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:27,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:27,728 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash 924079462, now seen corresponding path program 1 times [2023-02-15 21:50:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:27,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241755533] [2023-02-15 21:50:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:27,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:27,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:27,731 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:27,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 21:50:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:27,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 21:50:27,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:27,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:50:27,986 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 21:50:27,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 21:50:28,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:28,117 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:50:28,146 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:50:28,167 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:50:28,190 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:50:28,213 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:50:28,237 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:50:28,258 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:50:28,284 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:28,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 21:50:28,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-02-15 21:50:28,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 21:50:28,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-02-15 21:50:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 21:50:28,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:50:33,025 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2023-02-15 21:50:33,036 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_552) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-15 21:50:33,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:50:33,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-15 21:50:33,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-02-15 21:50:33,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:50:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 21:50:39,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:50:39,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241755533] [2023-02-15 21:50:39,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241755533] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:50:39,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:50:39,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 21:50:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349212234] [2023-02-15 21:50:39,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:50:39,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 21:50:39,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:50:39,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 21:50:39,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=286, Unknown=5, NotChecked=70, Total=420 [2023-02-15 21:50:39,229 INFO L87 Difference]: Start difference. First operand 220 states and 266 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:50:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:50:41,297 INFO L93 Difference]: Finished difference Result 219 states and 265 transitions. [2023-02-15 21:50:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 21:50:41,299 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 21:50:41,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:50:41,300 INFO L225 Difference]: With dead ends: 219 [2023-02-15 21:50:41,300 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 21:50:41,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=92, Invalid=417, Unknown=5, NotChecked=86, Total=600 [2023-02-15 21:50:41,301 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 25 mSDsluCounter, 1941 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 21:50:41,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2134 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 824 Invalid, 0 Unknown, 145 Unchecked, 1.8s Time] [2023-02-15 21:50:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 21:50:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-02-15 21:50:41,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 134 states have (on average 1.4179104477611941) internal successors, (190), 176 states have internal predecessors, (190), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 21:50:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 265 transitions. [2023-02-15 21:50:41,306 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 265 transitions. Word has length 30 [2023-02-15 21:50:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:50:41,306 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 265 transitions. [2023-02-15 21:50:41,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:50:41,306 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 265 transitions. [2023-02-15 21:50:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 21:50:41,307 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:50:41,307 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:50:41,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 21:50:41,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:41,518 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:50:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:50:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash 924079463, now seen corresponding path program 1 times [2023-02-15 21:50:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:50:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082133678] [2023-02-15 21:50:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:50:41,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:50:41,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:50:41,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:50:41,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 21:50:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:50:41,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-15 21:50:41,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:50:41,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:50:41,816 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 21:50:41,817 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 21:50:41,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 21:50:41,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:41,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:50:42,068 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:50:42,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:42,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:50:42,116 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:50:42,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:42,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:50:42,177 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:50:42,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:50:42,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:50:42,211 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:50:42,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:50:42,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:42,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:50:42,320 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:50:42,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:50:42,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:50:42,365 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:50:42,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:50:42,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:50:42,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:50:42,444 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:50:42,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:50:42,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:50:42,473 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:50:42,524 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:50:42,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-02-15 21:50:42,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 21:50:42,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 21:50:42,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 21:50:42,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-15 21:50:42,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2023-02-15 21:50:42,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-15 21:50:42,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 21:50:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 21:50:42,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:51:18,810 WARN L233 SmtUtils]: Spent 35.78s on a formula simplification that was a NOOP. DAG size: 195 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-15 21:51:27,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:51:27,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 21:51:27,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:51:27,717 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 35 treesize of output 36 [2023-02-15 21:51:27,722 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 62 treesize of output 50 [2023-02-15 21:51:27,726 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 96 treesize of output 78 [2023-02-15 21:51:27,734 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 40 treesize of output 32 [2023-02-15 21:51:27,739 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 66 treesize of output 58 [2023-02-15 21:51:27,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:51:27,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-02-15 21:51:27,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-02-15 21:51:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 21:51:28,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:51:28,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082133678] [2023-02-15 21:51:28,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082133678] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:51:28,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:51:28,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 21:51:28,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489047916] [2023-02-15 21:51:28,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:51:28,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 21:51:28,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:51:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 21:51:28,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=361, Unknown=4, NotChecked=0, Total=420 [2023-02-15 21:51:28,167 INFO L87 Difference]: Start difference. First operand 219 states and 265 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:51:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:51:40,684 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2023-02-15 21:51:40,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 21:51:40,686 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 21:51:40,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:51:40,687 INFO L225 Difference]: With dead ends: 218 [2023-02-15 21:51:40,687 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 21:51:40,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=169, Invalid=883, Unknown=4, NotChecked=0, Total=1056 [2023-02-15 21:51:40,687 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 54 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 20 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:51:40,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1945 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 913 Invalid, 9 Unknown, 0 Unchecked, 6.0s Time] [2023-02-15 21:51:40,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 21:51:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-15 21:51:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 175 states have internal predecessors, (189), 35 states have call successors, (35), 10 states have call predecessors, (35), 11 states have return successors, (40), 35 states have call predecessors, (40), 35 states have call successors, (40) [2023-02-15 21:51:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 264 transitions. [2023-02-15 21:51:40,692 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 264 transitions. Word has length 30 [2023-02-15 21:51:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:51:40,692 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 264 transitions. [2023-02-15 21:51:40,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 19 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:51:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 264 transitions. [2023-02-15 21:51:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 21:51:40,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:51:40,697 INFO L195 NwaCegarLoop]: trace histogram [8, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:51:40,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 21:51:40,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:40,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting DUPFFnewErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:51:40,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:51:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2092985884, now seen corresponding path program 1 times [2023-02-15 21:51:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:51:40,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146584157] [2023-02-15 21:51:40,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:51:40,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:40,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:51:40,900 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:51:40,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 21:51:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:51:41,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 21:51:41,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:51:41,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 21:51:41,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:51:41,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:51:41,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 21:51:41,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 21:51:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 21:51:41,232 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:51:41,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:51:41,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146584157] [2023-02-15 21:51:41,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146584157] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:51:41,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:51:41,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:51:41,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282118816] [2023-02-15 21:51:41,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:51:41,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:51:41,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:51:41,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:51:41,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:51:41,233 INFO L87 Difference]: Start difference. First operand 218 states and 264 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:51:42,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:51:42,133 INFO L93 Difference]: Finished difference Result 230 states and 271 transitions. [2023-02-15 21:51:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:51:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2023-02-15 21:51:42,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:51:42,134 INFO L225 Difference]: With dead ends: 230 [2023-02-15 21:51:42,134 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 21:51:42,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2023-02-15 21:51:42,135 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 59 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:51:42,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1202 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 21:51:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 21:51:42,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 213. [2023-02-15 21:51:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 130 states have (on average 1.376923076923077) internal successors, (179), 170 states have internal predecessors, (179), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:51:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 249 transitions. [2023-02-15 21:51:42,139 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 249 transitions. Word has length 42 [2023-02-15 21:51:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:51:42,140 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 249 transitions. [2023-02-15 21:51:42,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 21:51:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 249 transitions. [2023-02-15 21:51:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 21:51:42,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:51:42,141 INFO L195 NwaCegarLoop]: trace histogram [13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:51:42,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 21:51:42,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:42,353 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:51:42,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:51:42,353 INFO L85 PathProgramCache]: Analyzing trace with hash -562772518, now seen corresponding path program 1 times [2023-02-15 21:51:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:51:42,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249615135] [2023-02-15 21:51:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:51:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:51:42,355 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:51:42,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 21:51:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:51:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:51:42,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:51:42,774 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-15 21:51:42,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:51:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-02-15 21:51:43,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:51:43,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249615135] [2023-02-15 21:51:43,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249615135] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:51:43,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:51:43,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-02-15 21:51:43,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552455910] [2023-02-15 21:51:43,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:51:43,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 21:51:43,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:51:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 21:51:43,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:51:43,211 INFO L87 Difference]: Start difference. First operand 213 states and 249 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:51:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:51:45,092 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2023-02-15 21:51:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 21:51:45,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2023-02-15 21:51:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:51:45,094 INFO L225 Difference]: With dead ends: 291 [2023-02-15 21:51:45,094 INFO L226 Difference]: Without dead ends: 279 [2023-02-15 21:51:45,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=641, Invalid=1521, Unknown=0, NotChecked=0, Total=2162 [2023-02-15 21:51:45,098 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 188 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:51:45,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 2197 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 21:51:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-02-15 21:51:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 220. [2023-02-15 21:51:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 177 states have internal predecessors, (186), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:51:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 256 transitions. [2023-02-15 21:51:45,104 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 256 transitions. Word has length 56 [2023-02-15 21:51:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:51:45,104 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 256 transitions. [2023-02-15 21:51:45,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:51:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 256 transitions. [2023-02-15 21:51:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 21:51:45,105 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:51:45,105 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:51:45,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 21:51:45,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:45,315 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:51:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:51:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093162, now seen corresponding path program 2 times [2023-02-15 21:51:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:51:45,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488200665] [2023-02-15 21:51:45,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:51:45,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:45,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:51:45,317 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:51:45,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 21:51:45,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 21:51:45,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:51:45,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 21:51:45,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:51:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2023-02-15 21:51:45,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:51:45,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:51:45,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488200665] [2023-02-15 21:51:45,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488200665] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:51:45,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:51:45,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:51:45,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412438570] [2023-02-15 21:51:45,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:51:45,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:51:45,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:51:45,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:51:45,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:51:45,486 INFO L87 Difference]: Start difference. First operand 220 states and 256 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:51:45,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:51:45,903 INFO L93 Difference]: Finished difference Result 218 states and 254 transitions. [2023-02-15 21:51:45,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:51:45,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-02-15 21:51:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:51:45,905 INFO L225 Difference]: With dead ends: 218 [2023-02-15 21:51:45,905 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 21:51:45,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:51:45,905 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 22 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:51:45,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 738 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:51:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 21:51:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-15 21:51:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 137 states have (on average 1.3430656934306568) internal successors, (184), 175 states have internal predecessors, (184), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:51:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 254 transitions. [2023-02-15 21:51:45,909 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 254 transitions. Word has length 63 [2023-02-15 21:51:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:51:45,910 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 254 transitions. [2023-02-15 21:51:45,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:51:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 254 transitions. [2023-02-15 21:51:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 21:51:45,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:51:45,910 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:51:45,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 21:51:46,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:46,117 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:51:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:51:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2097093161, now seen corresponding path program 1 times [2023-02-15 21:51:46,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:51:46,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777872979] [2023-02-15 21:51:46,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:51:46,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:46,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:51:46,119 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:51:46,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 21:51:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:51:46,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 21:51:46,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:51:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-02-15 21:51:46,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:51:46,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:51:46,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777872979] [2023-02-15 21:51:46,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777872979] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:51:46,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:51:46,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:51:46,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469550957] [2023-02-15 21:51:46,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:51:46,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 21:51:46,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:51:46,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 21:51:46,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:51:46,573 INFO L87 Difference]: Start difference. First operand 218 states and 254 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:51:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:51:47,009 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2023-02-15 21:51:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:51:47,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2023-02-15 21:51:47,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:51:47,015 INFO L225 Difference]: With dead ends: 216 [2023-02-15 21:51:47,015 INFO L226 Difference]: Without dead ends: 216 [2023-02-15 21:51:47,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:51:47,016 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 16 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:51:47,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 787 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 21:51:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-15 21:51:47,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2023-02-15 21:51:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 173 states have internal predecessors, (182), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:51:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 252 transitions. [2023-02-15 21:51:47,023 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 252 transitions. Word has length 63 [2023-02-15 21:51:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:51:47,024 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 252 transitions. [2023-02-15 21:51:47,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 21:51:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 252 transitions. [2023-02-15 21:51:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 21:51:47,024 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:51:47,024 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:51:47,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-15 21:51:47,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:47,229 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:51:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:51:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash -585378383, now seen corresponding path program 1 times [2023-02-15 21:51:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:51:47,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513130302] [2023-02-15 21:51:47,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:51:47,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:47,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:51:47,231 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:51:47,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 21:51:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:51:47,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 21:51:47,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:51:47,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:51:47,928 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 21:51:47,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 21:51:47,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:51:48,062 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,084 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,105 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,127 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,155 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,181 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,206 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,227 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,251 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,274 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,297 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:51:48,324 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:51:48,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 21:51:48,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:51:48,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:51:48,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:51:48,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:51:48,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-02-15 21:51:48,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 21:51:48,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 21:51:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-15 21:51:48,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:51:55,854 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse0) v_ArrVal_1933) |c_DUPFFnew_~ans~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-15 21:51:55,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:51:55,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-02-15 21:51:55,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-02-15 21:51:55,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 21:51:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-15 21:51:58,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:51:58,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513130302] [2023-02-15 21:51:58,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513130302] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:51:58,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:51:58,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 21:51:58,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844955853] [2023-02-15 21:51:58,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:51:58,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 21:51:58,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:51:58,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 21:51:58,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=321, Unknown=3, NotChecked=36, Total=420 [2023-02-15 21:51:58,020 INFO L87 Difference]: Start difference. First operand 216 states and 252 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:51:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:51:59,643 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2023-02-15 21:51:59,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 21:51:59,643 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-15 21:51:59,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:51:59,644 INFO L225 Difference]: With dead ends: 220 [2023-02-15 21:51:59,644 INFO L226 Difference]: Without dead ends: 220 [2023-02-15 21:51:59,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=94, Invalid=459, Unknown=3, NotChecked=44, Total=600 [2023-02-15 21:51:59,645 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 33 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 21:51:59,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1952 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 768 Invalid, 0 Unknown, 69 Unchecked, 1.4s Time] [2023-02-15 21:51:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-02-15 21:51:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2023-02-15 21:51:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 172 states have internal predecessors, (181), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:51:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 251 transitions. [2023-02-15 21:51:59,648 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 251 transitions. Word has length 64 [2023-02-15 21:51:59,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:51:59,649 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 251 transitions. [2023-02-15 21:51:59,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:51:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 251 transitions. [2023-02-15 21:51:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 21:51:59,649 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:51:59,649 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:51:59,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-15 21:51:59,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:59,850 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:51:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:51:59,851 INFO L85 PathProgramCache]: Analyzing trace with hash -585378382, now seen corresponding path program 1 times [2023-02-15 21:51:59,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:51:59,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404656967] [2023-02-15 21:51:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:51:59,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:51:59,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:51:59,852 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:51:59,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 21:52:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:52:00,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 21:52:00,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:52:00,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:52:00,488 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 21:52:00,489 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 21:52:00,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-02-15 21:52:00,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:52:00,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:52:00,720 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:00,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:00,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:00,741 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:00,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:00,783 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:00,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:00,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:00,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:52:00,825 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:00,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:00,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:00,853 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:00,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:00,900 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:00,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:00,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:00,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:00,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:00,973 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:00,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:00,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:00,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:52:01,013 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:01,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:01,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:01,034 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:01,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:01,090 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:01,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:01,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:01,122 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:01,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:01,167 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:01,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:01,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 21:52:01,210 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:01,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:01,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:01,239 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:01,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:01,289 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:01,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:01,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:01,312 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:01,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:01,361 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:52:01,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 21:52:01,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 21:52:01,384 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:01,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2023-02-15 21:52:01,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:52:01,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 49 [2023-02-15 21:52:01,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 21:52:01,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 21:52:01,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:52:01,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 21:52:01,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 59 [2023-02-15 21:52:01,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2023-02-15 21:52:01,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 21:52:01,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:52:01,713 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-15 21:52:01,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:52:51,876 WARN L233 SmtUtils]: Spent 49.98s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-02-15 21:53:00,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:53:00,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2023-02-15 21:53:00,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36 [2023-02-15 21:53:00,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 21:53:00,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:53:00,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-02-15 21:53:00,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:53:00,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2023-02-15 21:53:00,072 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:53:00,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 21:53:00,078 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:53:00,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 21:53:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 131 proven. 12 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-02-15 21:53:00,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:53:00,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404656967] [2023-02-15 21:53:00,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404656967] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:53:00,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:53:00,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 21:53:00,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190766130] [2023-02-15 21:53:00,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:53:00,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 21:53:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:53:00,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 21:53:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=361, Unknown=4, NotChecked=0, Total=420 [2023-02-15 21:53:00,320 INFO L87 Difference]: Start difference. First operand 215 states and 251 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:53:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:53:09,802 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2023-02-15 21:53:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 21:53:09,803 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-15 21:53:09,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:53:09,805 INFO L225 Difference]: With dead ends: 219 [2023-02-15 21:53:09,805 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 21:53:09,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 100 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=168, Invalid=883, Unknown=5, NotChecked=0, Total=1056 [2023-02-15 21:53:09,806 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 63 mSDsluCounter, 1999 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 19 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:53:09,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 2174 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1009 Invalid, 5 Unknown, 0 Unchecked, 5.2s Time] [2023-02-15 21:53:09,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 21:53:09,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 214. [2023-02-15 21:53:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.313868613138686) internal successors, (180), 171 states have internal predecessors, (180), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-02-15 21:53:09,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2023-02-15 21:53:09,811 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 64 [2023-02-15 21:53:09,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:53:09,812 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2023-02-15 21:53:09,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 21:53:09,812 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2023-02-15 21:53:09,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 21:53:09,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:53:09,813 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:53:09,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-02-15 21:53:10,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:10,025 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:53:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:53:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741073, now seen corresponding path program 1 times [2023-02-15 21:53:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:53:10,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146510604] [2023-02-15 21:53:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:53:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:53:10,027 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:53:10,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 21:53:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:53:10,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 21:53:10,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:53:10,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:53:10,634 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649))) is different from true [2023-02-15 21:53:10,640 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~malloc33#1.base| (_ bv1 1)))) is different from true [2023-02-15 21:53:10,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:53:10,650 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32))) (_ bv1 1)))) is different from true [2023-02-15 21:53:10,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 21:53:10,660 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |c_DUPFFnew_#t~mem34#1.base| (_ bv1 1)))) is different from true [2023-02-15 21:53:10,664 WARN L859 $PredicateComparison]: unable to prove that (exists ((|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (v_ArrVal_2649 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| |c_DUPFFnew_~ans~0#1.base| v_ArrVal_2649) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ bv1 1)))) is different from true [2023-02-15 21:53:10,735 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 21:53:10,754 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-15 21:53:10,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 31 [2023-02-15 21:53:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 128 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 1 not checked. [2023-02-15 21:53:10,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:53:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 128 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-02-15 21:53:11,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:53:11,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146510604] [2023-02-15 21:53:11,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146510604] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:53:11,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:53:11,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 19 [2023-02-15 21:53:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610676913] [2023-02-15 21:53:11,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:53:11,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 21:53:11,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:53:11,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 21:53:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=179, Unknown=5, NotChecked=150, Total=380 [2023-02-15 21:53:11,294 INFO L87 Difference]: Start difference. First operand 214 states and 250 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 21:53:15,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:17,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:19,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:21,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:23,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:25,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:27,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:29,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 21:53:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:53:30,226 INFO L93 Difference]: Finished difference Result 280 states and 335 transitions. [2023-02-15 21:53:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 21:53:30,226 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2023-02-15 21:53:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:53:30,227 INFO L225 Difference]: With dead ends: 280 [2023-02-15 21:53:30,227 INFO L226 Difference]: Without dead ends: 280 [2023-02-15 21:53:30,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=859, Unknown=5, NotChecked=330, Total=1406 [2023-02-15 21:53:30,228 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 418 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 235 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 1308 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:53:30,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 847 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1275 Invalid, 8 Unknown, 1308 Unchecked, 18.3s Time] [2023-02-15 21:53:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-02-15 21:53:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 239. [2023-02-15 21:53:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 154 states have (on average 1.3246753246753247) internal successors, (204), 188 states have internal predecessors, (204), 40 states have call successors, (40), 12 states have call predecessors, (40), 13 states have return successors, (43), 41 states have call predecessors, (43), 40 states have call successors, (43) [2023-02-15 21:53:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2023-02-15 21:53:30,233 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 71 [2023-02-15 21:53:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:53:30,233 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2023-02-15 21:53:30,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 16 states have internal predecessors, (63), 3 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 21:53:30,233 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2023-02-15 21:53:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 21:53:30,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:53:30,233 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:53:30,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 21:53:30,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:30,446 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:53:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:53:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1825741072, now seen corresponding path program 1 times [2023-02-15 21:53:30,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:53:30,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133293736] [2023-02-15 21:53:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:53:30,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:53:30,447 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:53:30,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 21:53:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:53:31,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 21:53:31,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:53:31,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:53:31,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:53:31,377 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 29 treesize of output 17 [2023-02-15 21:53:31,386 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2940 (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2940) |c_DUPFFnew_#t~mem34#1.base| (bvadd (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)) (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2023-02-15 21:53:31,396 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2940 (_ BitVec 32)) (|DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2940) |DUPFFnew_#Ultimate.C_memset_#ptr#1.base| (bvadd (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)) (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2023-02-15 21:53:31,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:53:31,595 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 21:53:31,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 29 [2023-02-15 21:53:31,607 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 21:53:31,607 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 21:53:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 114 trivial. 126 not checked. [2023-02-15 21:53:31,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:53:34,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:53:34,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133293736] [2023-02-15 21:53:34,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133293736] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:53:34,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [722397891] [2023-02-15 21:53:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:53:34,630 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 21:53:34,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 21:53:34,631 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 21:53:34,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-15 21:53:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:53:36,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-15 21:53:36,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:53:36,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 7 [2023-02-15 21:53:36,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 21:53:36,146 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 21:53:36,146 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 12 treesize of output 18 [2023-02-15 21:53:36,159 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 21:53:36,159 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 21:53:36,621 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2940 (_ BitVec 32)) (|DUPFFnew_#t~malloc33#1.base| (_ BitVec 32)) (|DUPFFnew_~ans~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| |DUPFFnew_~ans~0#1.base| v_ArrVal_2940) |DUPFFnew_#t~malloc33#1.base| (bvadd (bvmul |c_DUPFFnew_#in~maxdeg#1| (_ bv4 32)) (_ bv4 32)))) (= (_ bv0 1) (select |c_old(#valid)| |DUPFFnew_~ans~0#1.base|)))) is different from true [2023-02-15 21:53:36,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:53:36,843 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-15 21:53:36,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 23 [2023-02-15 21:53:36,853 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 21:53:36,853 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 21:53:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 114 trivial. 128 not checked. [2023-02-15 21:53:37,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:53:38,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [722397891] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 21:53:38,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:53:38,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2023-02-15 21:53:38,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882197889] [2023-02-15 21:53:38,381 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:53:38,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 21:53:38,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:53:38,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 21:53:38,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1026, Unknown=4, NotChecked=198, Total=1332 [2023-02-15 21:53:38,382 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:53:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:53:45,509 INFO L93 Difference]: Finished difference Result 347 states and 437 transitions. [2023-02-15 21:53:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 21:53:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 71 [2023-02-15 21:53:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:53:45,511 INFO L225 Difference]: With dead ends: 347 [2023-02-15 21:53:45,511 INFO L226 Difference]: Without dead ends: 347 [2023-02-15 21:53:45,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=227, Invalid=2037, Unknown=4, NotChecked=282, Total=2550 [2023-02-15 21:53:45,512 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 445 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 3169 mSolverCounterSat, 204 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 4292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 3169 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 914 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:53:45,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1448 Invalid, 4292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 3169 Invalid, 5 Unknown, 914 Unchecked, 5.7s Time] [2023-02-15 21:53:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-02-15 21:53:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 309. [2023-02-15 21:53:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 195 states have (on average 1.4) internal successors, (273), 233 states have internal predecessors, (273), 67 states have call successors, (67), 13 states have call predecessors, (67), 15 states have return successors, (78), 68 states have call predecessors, (78), 67 states have call successors, (78) [2023-02-15 21:53:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 418 transitions. [2023-02-15 21:53:45,518 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 418 transitions. Word has length 71 [2023-02-15 21:53:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:53:45,518 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 418 transitions. [2023-02-15 21:53:45,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 24 states have internal predecessors, (89), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 21:53:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 418 transitions. [2023-02-15 21:53:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 21:53:45,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:53:45,519 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:53:45,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-15 21:53:45,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 21:53:45,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:45,926 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:53:45,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:53:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash -242190254, now seen corresponding path program 1 times [2023-02-15 21:53:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:53:45,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73507967] [2023-02-15 21:53:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:53:45,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:45,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:53:45,929 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:53:45,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-15 21:53:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:53:46,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 21:53:46,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:53:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-02-15 21:53:46,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:53:46,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:53:46,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73507967] [2023-02-15 21:53:46,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73507967] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:53:46,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:53:46,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 21:53:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737674053] [2023-02-15 21:53:46,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:53:46,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 21:53:46,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:53:46,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 21:53:46,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:53:46,485 INFO L87 Difference]: Start difference. First operand 309 states and 418 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 21:53:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:53:47,825 INFO L93 Difference]: Finished difference Result 320 states and 426 transitions. [2023-02-15 21:53:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:53:47,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2023-02-15 21:53:47,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:53:47,826 INFO L225 Difference]: With dead ends: 320 [2023-02-15 21:53:47,826 INFO L226 Difference]: Without dead ends: 320 [2023-02-15 21:53:47,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:53:47,827 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 218 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:53:47,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 749 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 21:53:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2023-02-15 21:53:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 314. [2023-02-15 21:53:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 199 states have (on average 1.3969849246231156) internal successors, (278), 237 states have internal predecessors, (278), 67 states have call successors, (67), 14 states have call predecessors, (67), 16 states have return successors, (78), 68 states have call predecessors, (78), 67 states have call successors, (78) [2023-02-15 21:53:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 423 transitions. [2023-02-15 21:53:47,833 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 423 transitions. Word has length 77 [2023-02-15 21:53:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:53:47,833 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 423 transitions. [2023-02-15 21:53:47,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 21:53:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 423 transitions. [2023-02-15 21:53:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 21:53:47,834 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:53:47,834 INFO L195 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:53:47,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-15 21:53:48,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:48,046 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:53:48,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:53:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash -242190253, now seen corresponding path program 1 times [2023-02-15 21:53:48,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:53:48,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010114779] [2023-02-15 21:53:48,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:53:48,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 21:53:48,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:53:48,048 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:53:48,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-15 21:53:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:53:48,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 21:53:48,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:53:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-02-15 21:53:48,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:53:48,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:53:48,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010114779] [2023-02-15 21:53:48,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010114779] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:53:48,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:53:48,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 21:53:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634931357] [2023-02-15 21:53:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:53:48,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:53:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:53:48,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:53:48,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:53:48,743 INFO L87 Difference]: Start difference. First operand 314 states and 423 transitions. Second operand has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 21:53:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:53:50,579 INFO L93 Difference]: Finished difference Result 321 states and 426 transitions. [2023-02-15 21:53:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 21:53:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 77 [2023-02-15 21:53:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:53:50,581 INFO L225 Difference]: With dead ends: 321 [2023-02-15 21:53:50,581 INFO L226 Difference]: Without dead ends: 321 [2023-02-15 21:53:50,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:53:50,581 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 255 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 21:53:50,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 915 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 21:53:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-02-15 21:53:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2023-02-15 21:53:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 237 states have internal predecessors, (277), 67 states have call successors, (67), 14 states have call predecessors, (67), 16 states have return successors, (78), 68 states have call predecessors, (78), 67 states have call successors, (78) [2023-02-15 21:53:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 422 transitions. [2023-02-15 21:53:50,587 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 422 transitions. Word has length 77 [2023-02-15 21:53:50,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:53:50,587 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 422 transitions. [2023-02-15 21:53:50,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 21:53:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 422 transitions. [2023-02-15 21:53:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-15 21:53:50,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:53:50,588 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:53:50,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-15 21:53:50,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:50,788 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:53:50,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:53:50,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953710, now seen corresponding path program 1 times [2023-02-15 21:53:50,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:53:50,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123306562] [2023-02-15 21:53:50,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:53:50,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:50,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:53:50,790 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:53:50,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-15 21:53:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:53:51,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 21:53:51,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:53:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-02-15 21:53:51,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:53:51,517 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-02-15 21:53:51,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:53:51,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123306562] [2023-02-15 21:53:51,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123306562] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:53:51,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:53:51,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2023-02-15 21:53:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338275686] [2023-02-15 21:53:51,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:53:51,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 21:53:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:53:51,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 21:53:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-15 21:53:51,518 INFO L87 Difference]: Start difference. First operand 314 states and 422 transitions. Second operand has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:53:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:53:53,241 INFO L93 Difference]: Finished difference Result 369 states and 494 transitions. [2023-02-15 21:53:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:53:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 86 [2023-02-15 21:53:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:53:53,243 INFO L225 Difference]: With dead ends: 369 [2023-02-15 21:53:53,243 INFO L226 Difference]: Without dead ends: 369 [2023-02-15 21:53:53,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 157 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-02-15 21:53:53,244 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 318 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 21:53:53,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1015 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-02-15 21:53:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-02-15 21:53:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 352. [2023-02-15 21:53:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 224 states have (on average 1.3839285714285714) internal successors, (310), 265 states have internal predecessors, (310), 74 states have call successors, (74), 17 states have call predecessors, (74), 22 states have return successors, (92), 75 states have call predecessors, (92), 74 states have call successors, (92) [2023-02-15 21:53:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 476 transitions. [2023-02-15 21:53:53,255 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 476 transitions. Word has length 86 [2023-02-15 21:53:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:53:53,255 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 476 transitions. [2023-02-15 21:53:53,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:53:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 476 transitions. [2023-02-15 21:53:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-15 21:53:53,256 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:53:53,256 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:53:53,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-15 21:53:53,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:53,470 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:53:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:53:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1112953709, now seen corresponding path program 1 times [2023-02-15 21:53:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:53:53,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113212437] [2023-02-15 21:53:53,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:53:53,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:53:53,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:53:53,472 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:53:53,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-15 21:53:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:53:53,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 21:53:53,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:53:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-15 21:53:54,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:53:55,104 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 24 treesize of output 20 [2023-02-15 21:53:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-15 21:53:55,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:53:55,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113212437] [2023-02-15 21:53:55,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113212437] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:53:55,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:53:55,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2023-02-15 21:53:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122454029] [2023-02-15 21:53:55,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:53:55,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 21:53:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:53:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 21:53:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2023-02-15 21:53:55,236 INFO L87 Difference]: Start difference. First operand 352 states and 476 transitions. Second operand has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 21:54:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:54:00,430 INFO L93 Difference]: Finished difference Result 374 states and 497 transitions. [2023-02-15 21:54:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:54:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 86 [2023-02-15 21:54:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:54:00,432 INFO L225 Difference]: With dead ends: 374 [2023-02-15 21:54:00,432 INFO L226 Difference]: Without dead ends: 374 [2023-02-15 21:54:00,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 144 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2023-02-15 21:54:00,433 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 320 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-15 21:54:00,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1588 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-02-15 21:54:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-02-15 21:54:00,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 357. [2023-02-15 21:54:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 228 states have (on average 1.368421052631579) internal successors, (312), 269 states have internal predecessors, (312), 74 states have call successors, (74), 18 states have call predecessors, (74), 23 states have return successors, (92), 75 states have call predecessors, (92), 74 states have call successors, (92) [2023-02-15 21:54:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 478 transitions. [2023-02-15 21:54:00,454 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 478 transitions. Word has length 86 [2023-02-15 21:54:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:54:00,455 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 478 transitions. [2023-02-15 21:54:00,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 3.772727272727273) internal successors, (83), 17 states have internal predecessors, (83), 7 states have call successors, (12), 8 states have call predecessors, (12), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 21:54:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 478 transitions. [2023-02-15 21:54:00,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-15 21:54:00,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:54:00,456 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:54:00,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-15 21:54:00,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:00,668 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:54:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:54:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash 194820021, now seen corresponding path program 2 times [2023-02-15 21:54:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:54:00,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428600254] [2023-02-15 21:54:00,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:54:00,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:00,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:54:00,669 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:54:00,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-15 21:54:01,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:54:01,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:54:01,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:54:01,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:54:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-02-15 21:54:01,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:54:01,416 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 21:54:01,416 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 16 treesize of output 15 [2023-02-15 21:54:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-02-15 21:54:01,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:54:01,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428600254] [2023-02-15 21:54:01,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428600254] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:54:01,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:54:01,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2023-02-15 21:54:01,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953170514] [2023-02-15 21:54:01,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:54:01,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 21:54:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:54:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 21:54:01,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:54:01,425 INFO L87 Difference]: Start difference. First operand 357 states and 478 transitions. Second operand has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 21:54:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:54:02,496 INFO L93 Difference]: Finished difference Result 372 states and 491 transitions. [2023-02-15 21:54:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 21:54:02,497 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 92 [2023-02-15 21:54:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:54:02,498 INFO L225 Difference]: With dead ends: 372 [2023-02-15 21:54:02,498 INFO L226 Difference]: Without dead ends: 372 [2023-02-15 21:54:02,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:54:02,498 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 255 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:54:02,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 673 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 21:54:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-02-15 21:54:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 358. [2023-02-15 21:54:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 230 states have (on average 1.3652173913043477) internal successors, (314), 269 states have internal predecessors, (314), 74 states have call successors, (74), 19 states have call predecessors, (74), 23 states have return successors, (92), 75 states have call predecessors, (92), 74 states have call successors, (92) [2023-02-15 21:54:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 480 transitions. [2023-02-15 21:54:02,505 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 480 transitions. Word has length 92 [2023-02-15 21:54:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:54:02,505 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 480 transitions. [2023-02-15 21:54:02,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 21:54:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 480 transitions. [2023-02-15 21:54:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-15 21:54:02,506 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:54:02,506 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:54:02,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-15 21:54:02,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:02,718 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:54:02,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:54:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash 194820022, now seen corresponding path program 2 times [2023-02-15 21:54:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:54:02,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131802946] [2023-02-15 21:54:02,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 21:54:02,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:02,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:54:02,720 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:54:02,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-15 21:54:03,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 21:54:03,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:54:03,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 21:54:03,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:54:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 7 proven. 143 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-02-15 21:54:03,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:54:03,926 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 8 treesize of output 6 [2023-02-15 21:54:04,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:54:04,063 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 16 treesize of output 20 [2023-02-15 21:54:04,585 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 143 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2023-02-15 21:54:04,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:54:04,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131802946] [2023-02-15 21:54:04,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131802946] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:54:04,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:54:04,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 28 [2023-02-15 21:54:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67723435] [2023-02-15 21:54:04,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:54:04,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 21:54:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:54:04,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 21:54:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2023-02-15 21:54:04,588 INFO L87 Difference]: Start difference. First operand 358 states and 480 transitions. Second operand has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-15 21:54:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:54:14,240 INFO L93 Difference]: Finished difference Result 465 states and 610 transitions. [2023-02-15 21:54:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 21:54:14,242 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 92 [2023-02-15 21:54:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:54:14,243 INFO L225 Difference]: With dead ends: 465 [2023-02-15 21:54:14,243 INFO L226 Difference]: Without dead ends: 465 [2023-02-15 21:54:14,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=264, Invalid=2088, Unknown=0, NotChecked=0, Total=2352 [2023-02-15 21:54:14,244 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 829 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 3367 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 3789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 3367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:54:14,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 2638 Invalid, 3789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 3367 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-02-15 21:54:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2023-02-15 21:54:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 418. [2023-02-15 21:54:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 265 states have (on average 1.4150943396226414) internal successors, (375), 305 states have internal predecessors, (375), 99 states have call successors, (99), 20 states have call predecessors, (99), 23 states have return successors, (115), 101 states have call predecessors, (115), 99 states have call successors, (115) [2023-02-15 21:54:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 589 transitions. [2023-02-15 21:54:14,269 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 589 transitions. Word has length 92 [2023-02-15 21:54:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:54:14,269 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 589 transitions. [2023-02-15 21:54:14,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 4.0) internal successors, (96), 21 states have internal predecessors, (96), 9 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-15 21:54:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 589 transitions. [2023-02-15 21:54:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-02-15 21:54:14,270 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:54:14,270 INFO L195 NwaCegarLoop]: trace histogram [20, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:54:14,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-02-15 21:54:14,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:14,481 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:54:14,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:54:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash -947573994, now seen corresponding path program 1 times [2023-02-15 21:54:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:54:14,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011728228] [2023-02-15 21:54:14,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:54:14,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:14,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:54:14,483 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:54:14,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-15 21:54:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:54:15,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 21:54:15,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:54:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2023-02-15 21:54:15,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:54:15,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:54:15,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011728228] [2023-02-15 21:54:15,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011728228] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:54:15,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:54:15,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:54:15,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632134798] [2023-02-15 21:54:15,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:54:15,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:54:15,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:54:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:54:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:54:15,041 INFO L87 Difference]: Start difference. First operand 418 states and 589 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-15 21:54:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:54:15,046 INFO L93 Difference]: Finished difference Result 421 states and 589 transitions. [2023-02-15 21:54:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:54:15,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 92 [2023-02-15 21:54:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:54:15,048 INFO L225 Difference]: With dead ends: 421 [2023-02-15 21:54:15,048 INFO L226 Difference]: Without dead ends: 418 [2023-02-15 21:54:15,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:54:15,048 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:54:15,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:54:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-02-15 21:54:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2023-02-15 21:54:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 265 states have (on average 1.4037735849056603) internal successors, (372), 305 states have internal predecessors, (372), 99 states have call successors, (99), 20 states have call predecessors, (99), 23 states have return successors, (115), 101 states have call predecessors, (115), 99 states have call successors, (115) [2023-02-15 21:54:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 586 transitions. [2023-02-15 21:54:15,055 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 586 transitions. Word has length 92 [2023-02-15 21:54:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:54:15,055 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 586 transitions. [2023-02-15 21:54:15,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-15 21:54:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 586 transitions. [2023-02-15 21:54:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-15 21:54:15,056 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:54:15,056 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:54:15,071 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 (29)] Ended with exit code 0 [2023-02-15 21:54:15,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:15,268 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting DUPFFdegErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:54:15,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:54:15,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883697, now seen corresponding path program 3 times [2023-02-15 21:54:15,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:54:15,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904388345] [2023-02-15 21:54:15,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 21:54:15,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:54:15,270 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:54:15,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-15 21:54:16,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 21:54:16,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:54:16,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 21:54:16,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:54:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2023-02-15 21:54:16,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:54:16,289 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 21:54:16,290 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 16 treesize of output 15 [2023-02-15 21:54:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2023-02-15 21:54:16,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:54:16,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904388345] [2023-02-15 21:54:16,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904388345] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:54:16,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:54:16,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2023-02-15 21:54:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25154500] [2023-02-15 21:54:16,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:54:16,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:54:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:54:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:54:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:54:16,323 INFO L87 Difference]: Start difference. First operand 418 states and 586 transitions. Second operand has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-15 21:54:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:54:17,029 INFO L93 Difference]: Finished difference Result 444 states and 612 transitions. [2023-02-15 21:54:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 21:54:17,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 101 [2023-02-15 21:54:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:54:17,030 INFO L225 Difference]: With dead ends: 444 [2023-02-15 21:54:17,031 INFO L226 Difference]: Without dead ends: 444 [2023-02-15 21:54:17,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:54:17,031 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 79 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 21:54:17,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 976 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 21:54:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-02-15 21:54:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 420. [2023-02-15 21:54:17,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 267 states have (on average 1.404494382022472) internal successors, (375), 306 states have internal predecessors, (375), 99 states have call successors, (99), 21 states have call predecessors, (99), 23 states have return successors, (115), 101 states have call predecessors, (115), 99 states have call successors, (115) [2023-02-15 21:54:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 589 transitions. [2023-02-15 21:54:17,038 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 589 transitions. Word has length 101 [2023-02-15 21:54:17,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:54:17,039 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 589 transitions. [2023-02-15 21:54:17,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-02-15 21:54:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 589 transitions. [2023-02-15 21:54:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-02-15 21:54:17,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:54:17,040 INFO L195 NwaCegarLoop]: trace histogram [20, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:54:17,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-15 21:54:17,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:17,252 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting DUPFFdegErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:54:17,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:54:17,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1134883696, now seen corresponding path program 3 times [2023-02-15 21:54:17,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:54:17,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450564619] [2023-02-15 21:54:17,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 21:54:17,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:17,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:54:17,256 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:54:17,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-15 21:54:18,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 21:54:18,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 21:54:18,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 21:54:18,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:54:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-02-15 21:54:18,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:54:18,745 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 8 treesize of output 6 [2023-02-15 21:54:18,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:54:18,900 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 16 treesize of output 20 [2023-02-15 21:54:19,600 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 21 proven. 139 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-02-15 21:54:19,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:54:19,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450564619] [2023-02-15 21:54:19,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450564619] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 21:54:19,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 21:54:19,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-02-15 21:54:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008165180] [2023-02-15 21:54:19,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 21:54:19,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 21:54:19,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:54:19,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 21:54:19,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2023-02-15 21:54:19,602 INFO L87 Difference]: Start difference. First operand 420 states and 589 transitions. Second operand has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 21:54:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:54:27,197 INFO L93 Difference]: Finished difference Result 551 states and 718 transitions. [2023-02-15 21:54:27,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 21:54:27,198 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) Word has length 101 [2023-02-15 21:54:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:54:27,199 INFO L225 Difference]: With dead ends: 551 [2023-02-15 21:54:27,200 INFO L226 Difference]: Without dead ends: 551 [2023-02-15 21:54:27,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=283, Invalid=2167, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 21:54:27,200 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 848 mSDsluCounter, 5370 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 5787 SdHoareTripleChecker+Invalid, 3116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:54:27,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 5787 Invalid, 3116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-02-15 21:54:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2023-02-15 21:54:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 417. [2023-02-15 21:54:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 265 states have (on average 1.4037735849056603) internal successors, (372), 304 states have internal predecessors, (372), 99 states have call successors, (99), 22 states have call predecessors, (99), 22 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-02-15 21:54:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 570 transitions. [2023-02-15 21:54:27,208 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 570 transitions. Word has length 101 [2023-02-15 21:54:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:54:27,208 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 570 transitions. [2023-02-15 21:54:27,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 22 states have internal predecessors, (96), 11 states have call successors, (19), 9 states have call predecessors, (19), 5 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-15 21:54:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 570 transitions. [2023-02-15 21:54:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-02-15 21:54:27,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:54:27,209 INFO L195 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:54:27,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-15 21:54:27,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:27,421 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:54:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:54:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2143025534, now seen corresponding path program 1 times [2023-02-15 21:54:27,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:54:27,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795099536] [2023-02-15 21:54:27,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:54:27,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:27,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:54:27,423 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:54:27,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-15 21:54:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:54:28,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 21:54:28,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:54:28,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2023-02-15 21:54:28,603 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 21:54:28,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 18 [2023-02-15 21:54:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-02-15 21:54:28,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 21:54:28,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 21:54:28,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795099536] [2023-02-15 21:54:28,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795099536] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:54:28,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:54:28,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-15 21:54:28,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480343263] [2023-02-15 21:54:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:54:28,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 21:54:28,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 21:54:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 21:54:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-02-15 21:54:28,645 INFO L87 Difference]: Start difference. First operand 417 states and 570 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:54:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:54:29,969 INFO L93 Difference]: Finished difference Result 375 states and 471 transitions. [2023-02-15 21:54:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 21:54:29,970 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 99 [2023-02-15 21:54:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:54:29,971 INFO L225 Difference]: With dead ends: 375 [2023-02-15 21:54:29,971 INFO L226 Difference]: Without dead ends: 364 [2023-02-15 21:54:29,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2023-02-15 21:54:29,972 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 1753 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:54:29,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1938 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 21:54:29,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-02-15 21:54:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 338. [2023-02-15 21:54:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 217 states have (on average 1.3410138248847927) internal successors, (291), 253 states have internal predecessors, (291), 70 states have call successors, (70), 20 states have call predecessors, (70), 20 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2023-02-15 21:54:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 431 transitions. [2023-02-15 21:54:29,978 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 431 transitions. Word has length 99 [2023-02-15 21:54:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:54:29,978 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 431 transitions. [2023-02-15 21:54:29,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 12 states have internal predecessors, (60), 3 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 21:54:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 431 transitions. [2023-02-15 21:54:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-02-15 21:54:29,979 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:54:29,979 INFO L195 NwaCegarLoop]: trace histogram [20, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:54:29,994 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 (32)] Ended with exit code 0 [2023-02-15 21:54:30,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:30,192 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting DUPFFexgcdErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [DUPFFnewErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, DUPFFnewErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2023-02-15 21:54:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:54:30,192 INFO L85 PathProgramCache]: Analyzing trace with hash 783105185, now seen corresponding path program 1 times [2023-02-15 21:54:30,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 21:54:30,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773249676] [2023-02-15 21:54:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:54:30,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 21:54:30,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 21:54:30,198 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 21:54:30,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-02-15 21:54:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:54:31,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 56 conjunts are in the unsatisfiable core [2023-02-15 21:54:31,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 21:54:31,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 21:54:31,408 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 21:54:31,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 21:54:31,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 21:54:31,567 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,589 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,619 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,644 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,669 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,690 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,712 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,737 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,763 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,787 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,807 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2023-02-15 21:54:31,832 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:31,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 21:54:31,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:31,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:31,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:31,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:31,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2023-02-15 21:54:31,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-02-15 21:54:32,020 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 21:54:32,020 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 32 treesize of output 33 [2023-02-15 21:54:32,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:32,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:32,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:32,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 21:54:32,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 55 [2023-02-15 21:54:32,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 21:54:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 131 proven. 16 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-02-15 21:54:32,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 21:54:33,078 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem68#1.base| v_ArrVal_6322) |c_ULTIMATE.start_main_~g~0#1.base|) (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2023-02-15 21:54:33,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~g~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~g~0#1.base|) .cse0) v_ArrVal_6322) |c_ULTIMATE.start_main_~g~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-15 21:54:33,093 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_#t~ret67#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0) v_ArrVal_6322) |c_ULTIMATE.start_main_#t~ret67#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-02-15 21:54:40,544 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6320 (_ BitVec 32)) (v_ArrVal_6319 (_ BitVec 32)) (v_ArrVal_6318 (_ BitVec 32)) (v_ArrVal_6317 (_ BitVec 32)) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse2 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_DUPFFnew_#t~mem34#1.base| v_ArrVal_6311))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store .cse1 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv4 32)) v_ArrVal_6320) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6319) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv6 32)) v_ArrVal_6318) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv7 32)) v_ArrVal_6317)) (select .cse1 .cse2) v_ArrVal_6322))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1)))) is different from false [2023-02-15 21:54:40,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6320 (_ BitVec 32)) (v_ArrVal_6319 (_ BitVec 32)) (v_ArrVal_6318 (_ BitVec 32)) (v_ArrVal_6317 (_ BitVec 32)) (v_ArrVal_6311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse2 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_DUPFFnew_~ans~0#1.base|) .cse2) v_ArrVal_6311))) (let ((.cse1 (select .cse0 |c_DUPFFnew_~ans~0#1.base|))) (store (store .cse0 |c_DUPFFnew_~ans~0#1.base| (store (store (store (store .cse1 (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv4 32)) v_ArrVal_6320) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv5 32)) v_ArrVal_6319) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv6 32)) v_ArrVal_6318) (bvadd |c_DUPFFnew_~ans~0#1.offset| (_ bv7 32)) v_ArrVal_6317)) (select .cse1 .cse2) v_ArrVal_6322))) |c_DUPFFnew_~ans~0#1.base|) .cse2))) (_ bv1 1)))) is different from false [2023-02-15 21:54:40,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 21:54:40,571 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 86 treesize of output 67 [2023-02-15 21:54:40,574 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 106 treesize of output 82 [2023-02-15 21:54:40,577 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 78 treesize of output 70 [2023-02-15 21:54:40,580 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 40 treesize of output 28