./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test19-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 16c93f411f7e7984964960171e6986ff89eb89f75783c8b2783bb47b46e751d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 21:22:34,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 21:22:34,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 21:22:34,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 21:22:34,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 21:22:34,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 21:22:34,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 21:22:34,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 21:22:34,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 21:22:34,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 21:22:34,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 21:22:34,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 21:22:34,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 21:22:34,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 21:22:34,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 21:22:34,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 21:22:34,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 21:22:34,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 21:22:34,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 21:22:34,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 21:22:34,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 21:22:34,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 21:22:34,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 21:22:34,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 21:22:34,080 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 21:22:34,081 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 21:22:34,081 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 21:22:34,082 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 21:22:34,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 21:22:34,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 21:22:34,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 21:22:34,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 21:22:34,085 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 21:22:34,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 21:22:34,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 21:22:34,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 21:22:34,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 21:22:34,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 21:22:34,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 21:22:34,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 21:22:34,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 21:22:34,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-18 21:22:34,114 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 21:22:34,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 21:22:34,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 21:22:34,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 21:22:34,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 21:22:34,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 21:22:34,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 21:22:34,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 21:22:34,116 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 21:22:34,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 21:22:34,117 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 21:22:34,117 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 21:22:34,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 21:22:34,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 21:22:34,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 21:22:34,118 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 21:22:34,118 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 21:22:34,118 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 21:22:34,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 21:22:34,118 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 21:22:34,118 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 21:22:34,119 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 21:22:34,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 21:22:34,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 21:22:34,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 21:22:34,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:22:34,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 21:22:34,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 21:22:34,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 21:22:34,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 21:22:34,120 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 21:22:34,120 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 21:22:34,121 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 21:22:34,121 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 21:22:34,121 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 -> 16c93f411f7e7984964960171e6986ff89eb89f75783c8b2783bb47b46e751d9 [2023-02-18 21:22:34,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 21:22:34,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 21:22:34,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 21:22:34,336 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 21:22:34,336 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 21:22:34,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2023-02-18 21:22:35,324 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 21:22:35,568 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 21:22:35,568 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2023-02-18 21:22:35,578 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4773dd65/e7aa9d3ab57342dda9fa21afe4be14ea/FLAG17784de9a [2023-02-18 21:22:35,587 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4773dd65/e7aa9d3ab57342dda9fa21afe4be14ea [2023-02-18 21:22:35,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 21:22:35,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 21:22:35,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 21:22:35,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 21:22:35,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 21:22:35,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:22:35" (1/1) ... [2023-02-18 21:22:35,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221ae4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:35, skipping insertion in model container [2023-02-18 21:22:35,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:22:35" (1/1) ... [2023-02-18 21:22:35,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 21:22:35,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 21:22:35,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:22:35,842 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-18 21:22:35,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@11b80096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:35, skipping insertion in model container [2023-02-18 21:22:35,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 21:22:35,843 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-18 21:22:35,845 INFO L158 Benchmark]: Toolchain (without parser) took 254.45ms. Allocated memory is still 184.5MB. Free memory was 150.2MB in the beginning and 136.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 21:22:35,845 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 21:22:35,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.95ms. Allocated memory is still 184.5MB. Free memory was 149.6MB in the beginning and 136.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 21:22:35,846 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.95ms. Allocated memory is still 184.5MB. Free memory was 149.6MB in the beginning and 136.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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/ldv-memsafety/memleaks_test19-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 16c93f411f7e7984964960171e6986ff89eb89f75783c8b2783bb47b46e751d9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-18 21:22:37,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 21:22:37,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 21:22:37,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 21:22:37,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 21:22:37,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 21:22:37,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 21:22:37,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 21:22:37,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 21:22:37,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 21:22:37,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 21:22:37,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 21:22:37,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 21:22:37,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 21:22:37,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 21:22:37,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 21:22:37,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 21:22:37,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 21:22:37,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 21:22:37,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 21:22:37,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 21:22:37,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 21:22:37,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 21:22:37,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 21:22:37,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 21:22:37,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 21:22:37,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 21:22:37,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 21:22:37,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 21:22:37,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 21:22:37,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 21:22:37,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 21:22:37,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 21:22:37,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 21:22:37,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 21:22:37,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 21:22:37,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 21:22:37,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 21:22:37,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 21:22:37,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 21:22:37,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 21:22:37,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-18 21:22:37,514 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 21:22:37,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 21:22:37,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 21:22:37,515 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 21:22:37,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 21:22:37,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 21:22:37,516 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 21:22:37,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 21:22:37,516 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 21:22:37,517 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 21:22:37,517 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 21:22:37,517 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 21:22:37,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 21:22:37,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 21:22:37,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 21:22:37,518 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-18 21:22:37,518 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-18 21:22:37,518 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-18 21:22:37,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 21:22:37,519 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 21:22:37,519 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 21:22:37,519 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 21:22:37,519 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 21:22:37,519 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 21:22:37,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 21:22:37,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 21:22:37,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 21:22:37,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:22:37,520 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 21:22:37,520 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 21:22:37,520 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 21:22:37,521 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 21:22:37,521 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 21:22:37,521 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 21:22:37,521 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 21:22:37,521 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 21:22:37,521 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 21:22:37,522 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 -> 16c93f411f7e7984964960171e6986ff89eb89f75783c8b2783bb47b46e751d9 [2023-02-18 21:22:37,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 21:22:37,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 21:22:37,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 21:22:37,798 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 21:22:37,799 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 21:22:37,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2023-02-18 21:22:38,777 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 21:22:39,024 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 21:22:39,025 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2023-02-18 21:22:39,048 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955e516e1/8ba0d5598007474f9a3b029f5e126825/FLAG85a505b1b [2023-02-18 21:22:39,058 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/955e516e1/8ba0d5598007474f9a3b029f5e126825 [2023-02-18 21:22:39,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 21:22:39,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 21:22:39,062 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 21:22:39,062 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 21:22:39,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 21:22:39,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7777d74b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39, skipping insertion in model container [2023-02-18 21:22:39,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 21:22:39,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 21:22:39,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:22:39,302 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-18 21:22:39,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 21:22:39,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:22:39,340 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 21:22:39,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 21:22:39,434 INFO L208 MainTranslator]: Completed translation [2023-02-18 21:22:39,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39 WrapperNode [2023-02-18 21:22:39,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 21:22:39,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 21:22:39,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 21:22:39,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 21:22:39,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,486 INFO L138 Inliner]: procedures = 171, calls = 87, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 77 [2023-02-18 21:22:39,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 21:22:39,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 21:22:39,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 21:22:39,488 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 21:22:39,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,510 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,529 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 21:22:39,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 21:22:39,530 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 21:22:39,530 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 21:22:39,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (1/1) ... [2023-02-18 21:22:39,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 21:22:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 21:22:39,550 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-18 21:22:39,572 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-18 21:22:39,606 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2023-02-18 21:22:39,610 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2023-02-18 21:22:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-18 21:22:39,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-18 21:22:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-18 21:22:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 21:22:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-18 21:22:39,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-18 21:22:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-18 21:22:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-18 21:22:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-18 21:22:39,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 21:22:39,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 21:22:39,704 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 21:22:39,705 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 21:22:39,881 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 21:22:39,886 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 21:22:39,886 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-18 21:22:39,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:22:39 BoogieIcfgContainer [2023-02-18 21:22:39,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 21:22:39,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 21:22:39,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 21:22:39,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 21:22:39,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 09:22:39" (1/3) ... [2023-02-18 21:22:39,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6633f27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:22:39, skipping insertion in model container [2023-02-18 21:22:39,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 09:22:39" (2/3) ... [2023-02-18 21:22:39,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6633f27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:22:39, skipping insertion in model container [2023-02-18 21:22:39,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:22:39" (3/3) ... [2023-02-18 21:22:39,892 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19-1.i [2023-02-18 21:22:39,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 21:22:39,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-18 21:22:39,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 21:22:39,933 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;@6030bb14, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 21:22:39,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-18 21:22:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 21:22:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 21:22:39,940 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:39,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:39,940 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1461209413, now seen corresponding path program 1 times [2023-02-18 21:22:39,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:39,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365038100] [2023-02-18 21:22:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:39,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:22:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:39,955 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-18 21:22:39,990 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-18 21:22:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:40,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 21:22:40,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:40,087 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-18 21:22:40,101 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-18 21:22:40,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:22:40,109 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 28 [2023-02-18 21:22:40,121 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-18 21:22:40,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:40,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365038100] [2023-02-18 21:22:40,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365038100] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:40,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:40,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:22:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469792077] [2023-02-18 21:22:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:40,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:22:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:40,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:22:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-18 21:22:40,145 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 64 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-18 21:22:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:40,271 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2023-02-18 21:22:40,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:22:40,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2023-02-18 21:22:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:40,282 INFO L225 Difference]: With dead ends: 98 [2023-02-18 21:22:40,282 INFO L226 Difference]: Without dead ends: 96 [2023-02-18 21:22:40,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-18 21:22:40,286 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 51 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:40,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 151 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2023-02-18 21:22:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-18 21:22:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2023-02-18 21:22:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 68 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 21:22:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2023-02-18 21:22:40,323 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 8 [2023-02-18 21:22:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:40,323 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2023-02-18 21:22:40,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-18 21:22:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2023-02-18 21:22:40,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-18 21:22:40,325 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:40,325 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:40,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-18 21:22:40,534 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-18 21:22:40,535 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:40,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1461209414, now seen corresponding path program 1 times [2023-02-18 21:22:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:40,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006857600] [2023-02-18 21:22:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:40,537 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-18 21:22:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:40,550 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-18 21:22:40,551 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-18 21:22:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:40,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 21:22:40,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:40,669 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-18 21:22:40,672 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-18 21:22:40,687 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_13 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_13))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-18 21:22:40,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:40,702 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-18 21:22:40,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:22:40,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 21:22:40,711 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-18 21:22:40,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:40,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:40,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006857600] [2023-02-18 21:22:40,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006857600] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:40,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:40,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:22:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48559832] [2023-02-18 21:22:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:40,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:22:40,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:22:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-18 21:22:40,714 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-18 21:22:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:40,889 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2023-02-18 21:22:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 21:22:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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 8 [2023-02-18 21:22:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:40,890 INFO L225 Difference]: With dead ends: 120 [2023-02-18 21:22:40,890 INFO L226 Difference]: Without dead ends: 120 [2023-02-18 21:22:40,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-18 21:22:40,891 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 108 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:40,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 154 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 119 Unchecked, 0.2s Time] [2023-02-18 21:22:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-18 21:22:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2023-02-18 21:22:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 69 states have internal predecessors, (82), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 21:22:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2023-02-18 21:22:40,903 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 8 [2023-02-18 21:22:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:40,903 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2023-02-18 21:22:40,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-18 21:22:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2023-02-18 21:22:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 21:22:40,905 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:40,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:40,918 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-18 21:22:41,112 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-18 21:22:41,113 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1807662222, now seen corresponding path program 1 times [2023-02-18 21:22:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:41,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022280042] [2023-02-18 21:22:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:41,114 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-18 21:22:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:41,125 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-18 21:22:41,127 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-18 21:22:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:41,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 21:22:41,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:41,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 21:22:41,222 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 20 treesize of output 8 [2023-02-18 21:22:41,228 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-18 21:22:41,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:41,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:41,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022280042] [2023-02-18 21:22:41,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022280042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:41,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:41,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 21:22:41,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735482319] [2023-02-18 21:22:41,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:41,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:22:41,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:22:41,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:22:41,231 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-18 21:22:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:41,296 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2023-02-18 21:22:41,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:22:41,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2023-02-18 21:22:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:41,297 INFO L225 Difference]: With dead ends: 86 [2023-02-18 21:22:41,297 INFO L226 Difference]: Without dead ends: 86 [2023-02-18 21:22:41,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:22:41,298 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:41,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 320 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:22:41,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-18 21:22:41,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-02-18 21:22:41,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.6226415094339623) internal successors, (86), 72 states have internal predecessors, (86), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 21:22:41,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-02-18 21:22:41,304 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 15 [2023-02-18 21:22:41,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:41,305 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-02-18 21:22:41,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-18 21:22:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-02-18 21:22:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 21:22:41,305 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:41,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:41,319 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 (4)] Ended with exit code 0 [2023-02-18 21:22:41,512 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-18 21:22:41,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:41,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:41,513 INFO L85 PathProgramCache]: Analyzing trace with hash 690353715, now seen corresponding path program 1 times [2023-02-18 21:22:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:41,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421087061] [2023-02-18 21:22:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:41,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:22:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:41,515 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-18 21:22:41,517 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-18 21:22:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:41,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 21:22:41,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:41,569 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-18 21:22:41,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:41,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:41,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421087061] [2023-02-18 21:22:41,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421087061] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:41,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:41,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:22:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293015878] [2023-02-18 21:22:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:41,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:22:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:41,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:22:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:22:41,572 INFO L87 Difference]: Start difference. First operand 81 states and 98 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 21:22:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:41,596 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2023-02-18 21:22:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:22:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2023-02-18 21:22:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:41,598 INFO L225 Difference]: With dead ends: 88 [2023-02-18 21:22:41,599 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 21:22:41,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 21:22:41,603 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 25 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:41,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 250 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:22:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 21:22:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-02-18 21:22:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.5892857142857142) internal successors, (89), 75 states have internal predecessors, (89), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 21:22:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2023-02-18 21:22:41,618 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 15 [2023-02-18 21:22:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:41,618 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2023-02-18 21:22:41,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 21:22:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2023-02-18 21:22:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:22:41,619 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:41,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:41,629 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-18 21:22:41,826 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-18 21:22:41,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash 891124571, now seen corresponding path program 1 times [2023-02-18 21:22:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:41,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676623149] [2023-02-18 21:22:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:41,828 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-18 21:22:41,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:41,831 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-18 21:22:41,833 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-18 21:22:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:41,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 21:22:41,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:41,912 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-18 21:22:41,929 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-18 21:22:41,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:22:41,933 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 28 [2023-02-18 21:22:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:41,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:41,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676623149] [2023-02-18 21:22:41,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676623149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:41,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:41,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:22:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058486127] [2023-02-18 21:22:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:41,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:22:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:41,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:22:41,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-18 21:22:41,941 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:42,072 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2023-02-18 21:22:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:22:42,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-18 21:22:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:42,074 INFO L225 Difference]: With dead ends: 118 [2023-02-18 21:22:42,074 INFO L226 Difference]: Without dead ends: 118 [2023-02-18 21:22:42,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-18 21:22:42,074 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 80 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:42,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 182 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 126 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2023-02-18 21:22:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-18 21:22:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2023-02-18 21:22:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 73 states have internal predecessors, (85), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 21:22:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2023-02-18 21:22:42,079 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 17 [2023-02-18 21:22:42,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:42,079 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2023-02-18 21:22:42,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2023-02-18 21:22:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:22:42,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:42,080 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:42,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-18 21:22:42,287 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-18 21:22:42,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash 891124572, now seen corresponding path program 1 times [2023-02-18 21:22:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:42,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607091306] [2023-02-18 21:22:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:42,289 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-18 21:22:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:42,290 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-18 21:22:42,293 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-18 21:22:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:42,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 21:22:42,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:42,364 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-18 21:22:42,393 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_61 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_61))))) is different from true [2023-02-18 21:22:42,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:42,406 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 16 treesize of output 18 [2023-02-18 21:22:42,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:22:42,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 21:22:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:42,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:42,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607091306] [2023-02-18 21:22:42,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607091306] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:42,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:42,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:22:42,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056308080] [2023-02-18 21:22:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:42,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:22:42,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:42,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:22:42,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2023-02-18 21:22:42,422 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:42,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:42,688 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2023-02-18 21:22:42,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 21:22:42,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-18 21:22:42,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:42,689 INFO L225 Difference]: With dead ends: 148 [2023-02-18 21:22:42,689 INFO L226 Difference]: Without dead ends: 148 [2023-02-18 21:22:42,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=60, Unknown=1, NotChecked=16, Total=110 [2023-02-18 21:22:42,690 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 158 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:42,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 233 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 210 Invalid, 0 Unknown, 138 Unchecked, 0.2s Time] [2023-02-18 21:22:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-18 21:22:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 80. [2023-02-18 21:22:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 71 states have internal predecessors, (81), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-18 21:22:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-02-18 21:22:42,694 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 17 [2023-02-18 21:22:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:42,695 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-02-18 21:22:42,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-02-18 21:22:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 21:22:42,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:42,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:42,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-18 21:22:42,896 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-18 21:22:42,896 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:42,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2005389781, now seen corresponding path program 1 times [2023-02-18 21:22:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061220320] [2023-02-18 21:22:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:42,897 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-18 21:22:42,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:42,898 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-18 21:22:42,903 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-18 21:22:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:42,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 21:22:42,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:42,975 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a19~0#1.base_6| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_6|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_6| (_ bv0 1))))) is different from true [2023-02-18 21:22:42,977 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-18 21:22:42,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:42,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:42,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061220320] [2023-02-18 21:22:42,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061220320] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:42,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:42,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:22:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400386912] [2023-02-18 21:22:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:42,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:22:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:22:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-18 21:22:42,979 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:22:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:43,082 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2023-02-18 21:22:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:22:43,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-18 21:22:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:43,083 INFO L225 Difference]: With dead ends: 111 [2023-02-18 21:22:43,083 INFO L226 Difference]: Without dead ends: 105 [2023-02-18 21:22:43,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-18 21:22:43,084 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 36 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:43,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 184 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2023-02-18 21:22:43,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-18 21:22:43,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-02-18 21:22:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 78 states have internal predecessors, (90), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:22:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2023-02-18 21:22:43,089 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 17 [2023-02-18 21:22:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:43,089 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2023-02-18 21:22:43,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 21:22:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2023-02-18 21:22:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 21:22:43,090 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:43,090 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:43,099 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-18 21:22:43,297 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-18 21:22:43,297 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:43,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1867537779, now seen corresponding path program 1 times [2023-02-18 21:22:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:43,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284357015] [2023-02-18 21:22:43,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:43,298 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-18 21:22:43,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:43,300 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-18 21:22:43,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 (9)] Waiting until timeout for monitored process [2023-02-18 21:22:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:43,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 21:22:43,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:22:43,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:43,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:43,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284357015] [2023-02-18 21:22:43,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284357015] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:43,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:43,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:22:43,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269377737] [2023-02-18 21:22:43,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:43,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:22:43,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:43,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:22:43,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:22:43,387 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:22:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:43,402 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2023-02-18 21:22:43,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:22:43,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-02-18 21:22:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:43,403 INFO L225 Difference]: With dead ends: 166 [2023-02-18 21:22:43,403 INFO L226 Difference]: Without dead ends: 166 [2023-02-18 21:22:43,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:22:43,404 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 83 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:43,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 227 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:22:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-18 21:22:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 94. [2023-02-18 21:22:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.391304347826087) internal successors, (96), 84 states have internal predecessors, (96), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:22:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2023-02-18 21:22:43,409 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 23 [2023-02-18 21:22:43,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:43,409 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2023-02-18 21:22:43,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:22:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2023-02-18 21:22:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-18 21:22:43,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:43,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:43,433 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-18 21:22:43,618 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-18 21:22:43,619 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1867478197, now seen corresponding path program 1 times [2023-02-18 21:22:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:43,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854224769] [2023-02-18 21:22:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:43,620 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-18 21:22:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:43,625 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-18 21:22:43,626 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-18 21:22:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:43,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 21:22:43,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:43,713 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 11 treesize of output 7 [2023-02-18 21:22:43,720 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 16 treesize of output 8 [2023-02-18 21:22:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 21:22:43,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:43,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:43,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854224769] [2023-02-18 21:22:43,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854224769] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:43,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:43,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 21:22:43,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943754435] [2023-02-18 21:22:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:43,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:22:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:43,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:22:43,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:22:43,729 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-18 21:22:43,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:43,784 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2023-02-18 21:22:43,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:22:43,785 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 23 [2023-02-18 21:22:43,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:43,785 INFO L225 Difference]: With dead ends: 117 [2023-02-18 21:22:43,785 INFO L226 Difference]: Without dead ends: 117 [2023-02-18 21:22:43,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:22:43,786 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:43,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 302 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:22:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-18 21:22:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 92. [2023-02-18 21:22:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.373134328358209) internal successors, (92), 81 states have internal predecessors, (92), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:22:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-02-18 21:22:43,791 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 23 [2023-02-18 21:22:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:43,792 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-02-18 21:22:43,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-18 21:22:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-02-18 21:22:43,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 21:22:43,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:43,795 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:43,811 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-18 21:22:44,002 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-18 21:22:44,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:44,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash 440766702, now seen corresponding path program 1 times [2023-02-18 21:22:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268192383] [2023-02-18 21:22:44,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:44,004 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-18 21:22:44,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:44,005 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-18 21:22:44,012 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-18 21:22:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:44,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 21:22:44,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:44,087 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-18 21:22:44,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:44,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 21:22:44,154 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-18 21:22:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:44,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:22:46,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:46,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268192383] [2023-02-18 21:22:46,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268192383] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:22:46,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2070411401] [2023-02-18 21:22:46,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:46,199 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:22:46,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:22:46,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:22:46,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2023-02-18 21:22:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:46,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 21:22:46,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:46,336 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-18 21:22:46,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:46,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 21:22:46,382 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-18 21:22:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:46,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:22:48,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2070411401] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:22:48,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:22:48,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-18 21:22:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256728214] [2023-02-18 21:22:48,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:22:48,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 21:22:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:48,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 21:22:48,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2023-02-18 21:22:48,414 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:48,526 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2023-02-18 21:22:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 21:22:48,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-02-18 21:22:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:48,527 INFO L225 Difference]: With dead ends: 91 [2023-02-18 21:22:48,527 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 21:22:48,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=64, Invalid=175, Unknown=1, NotChecked=0, Total=240 [2023-02-18 21:22:48,528 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 85 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:48,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:22:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 21:22:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-18 21:22:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 80 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:22:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2023-02-18 21:22:48,531 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 24 [2023-02-18 21:22:48,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:48,531 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2023-02-18 21:22:48,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2023-02-18 21:22:48,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-18 21:22:48,532 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:48,532 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:22:48,560 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-18 21:22:48,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2023-02-18 21:22:48,953 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 21:22:48,954 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash 778865962, now seen corresponding path program 1 times [2023-02-18 21:22:48,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:48,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719764076] [2023-02-18 21:22:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:48,955 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-18 21:22:48,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:48,956 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-18 21:22:48,958 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-18 21:22:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:49,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 21:22:49,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:49,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:49,047 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-18 21:22:49,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:22:49,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 21:22:49,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-18 21:22:49,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:49,177 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 41 treesize of output 28 [2023-02-18 21:22:49,196 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 39 treesize of output 15 [2023-02-18 21:22:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:49,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:22:49,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:49,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719764076] [2023-02-18 21:22:49,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719764076] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:22:49,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1845218516] [2023-02-18 21:22:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:49,310 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:22:49,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:22:49,317 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:22:49,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-02-18 21:22:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:49,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 21:22:49,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:49,482 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-18 21:22:51,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:51,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 21:22:51,620 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-18 21:22:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:51,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:22:51,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1845218516] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:22:51,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:22:51,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2023-02-18 21:22:51,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224867890] [2023-02-18 21:22:51,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:22:51,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 21:22:51,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:51,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 21:22:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=312, Unknown=1, NotChecked=0, Total=380 [2023-02-18 21:22:51,680 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 18 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 21:22:53,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:22:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:54,618 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2023-02-18 21:22:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 21:22:54,619 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 25 [2023-02-18 21:22:54,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:54,620 INFO L225 Difference]: With dead ends: 204 [2023-02-18 21:22:54,620 INFO L226 Difference]: Without dead ends: 204 [2023-02-18 21:22:54,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=304, Invalid=1501, Unknown=1, NotChecked=0, Total=1806 [2023-02-18 21:22:54,621 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 410 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:54,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 292 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 356 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2023-02-18 21:22:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-18 21:22:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 102. [2023-02-18 21:22:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 89 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:22:54,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2023-02-18 21:22:54,631 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 25 [2023-02-18 21:22:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:54,632 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2023-02-18 21:22:54,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.8) internal successors, (42), 16 states have internal predecessors, (42), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 21:22:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2023-02-18 21:22:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 21:22:54,632 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:54,633 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:22:54,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2023-02-18 21:22:54,844 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-18 21:22:55,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-18 21:22:55,043 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:55,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:55,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1765484354, now seen corresponding path program 1 times [2023-02-18 21:22:55,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:55,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755173014] [2023-02-18 21:22:55,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:55,043 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-18 21:22:55,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:55,046 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-18 21:22:55,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-18 21:22:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:55,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 21:22:55,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:22:55,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:55,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:55,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755173014] [2023-02-18 21:22:55,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755173014] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:55,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:55,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:22:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470153278] [2023-02-18 21:22:55,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:55,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:22:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:22:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:22:55,122 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:55,231 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-02-18 21:22:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 21:22:55,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-02-18 21:22:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:55,232 INFO L225 Difference]: With dead ends: 123 [2023-02-18 21:22:55,232 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 21:22:55,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:22:55,232 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 90 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:55,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 148 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:22:55,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 21:22:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2023-02-18 21:22:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 90 states have internal predecessors, (103), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:22:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-02-18 21:22:55,236 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 27 [2023-02-18 21:22:55,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:55,236 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-02-18 21:22:55,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-02-18 21:22:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 21:22:55,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:55,237 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:22:55,252 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 (15)] Ended with exit code 0 [2023-02-18 21:22:55,450 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-18 21:22:55,450 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:55,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1765484353, now seen corresponding path program 1 times [2023-02-18 21:22:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:55,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172090691] [2023-02-18 21:22:55,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:55,452 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-18 21:22:55,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:55,453 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-18 21:22:55,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-18 21:22:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:55,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 21:22:55,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:22:55,536 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:22:55,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:55,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172090691] [2023-02-18 21:22:55,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172090691] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:22:55,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:22:55,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 21:22:55,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855994983] [2023-02-18 21:22:55,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:22:55,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 21:22:55,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:22:55,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 21:22:55,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 21:22:55,538 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:22:55,660 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-18 21:22:55,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 21:22:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-02-18 21:22:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:22:55,661 INFO L225 Difference]: With dead ends: 112 [2023-02-18 21:22:55,661 INFO L226 Difference]: Without dead ends: 112 [2023-02-18 21:22:55,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-18 21:22:55,662 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:22:55,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 180 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:22:55,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-18 21:22:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2023-02-18 21:22:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.345679012345679) internal successors, (109), 95 states have internal predecessors, (109), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:22:55,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2023-02-18 21:22:55,665 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 27 [2023-02-18 21:22:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:22:55,665 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2023-02-18 21:22:55,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:22:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2023-02-18 21:22:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 21:22:55,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:22:55,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:22:55,693 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-18 21:22:55,873 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-18 21:22:55,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:22:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:22:55,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1624958864, now seen corresponding path program 1 times [2023-02-18 21:22:55,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:22:55,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570660385] [2023-02-18 21:22:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:55,874 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-18 21:22:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:22:55,877 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-18 21:22:55,878 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-18 21:22:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:55,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 21:22:55,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:55,944 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-18 21:22:55,954 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-18 21:22:55,970 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 3 [2023-02-18 21:22:55,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:55,981 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 23 treesize of output 22 [2023-02-18 21:22:55,985 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 21 treesize of output 9 [2023-02-18 21:22:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:55,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:22:58,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:22:58,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570660385] [2023-02-18 21:22:58,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570660385] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:22:58,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1136790916] [2023-02-18 21:22:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:22:58,056 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:22:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:22:58,058 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:22:58,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-18 21:22:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:22:58,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 21:22:58,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:22:58,191 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-18 21:22:58,201 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-18 21:22:58,212 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 3 [2023-02-18 21:22:58,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:22:58,225 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 23 treesize of output 22 [2023-02-18 21:22:58,232 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 21 treesize of output 9 [2023-02-18 21:22:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:22:58,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:00,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1136790916] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:00,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:23:00,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-18 21:23:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167852102] [2023-02-18 21:23:00,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:23:00,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 21:23:00,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:00,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 21:23:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2023-02-18 21:23:00,293 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:00,545 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2023-02-18 21:23:00,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 21:23:00,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-18 21:23:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:00,546 INFO L225 Difference]: With dead ends: 126 [2023-02-18 21:23:00,546 INFO L226 Difference]: Without dead ends: 126 [2023-02-18 21:23:00,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=40, Invalid=115, Unknown=1, NotChecked=0, Total=156 [2023-02-18 21:23:00,546 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 77 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:00,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 316 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:23:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-18 21:23:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2023-02-18 21:23:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 99 states have internal predecessors, (113), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-18 21:23:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2023-02-18 21:23:00,549 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 26 [2023-02-18 21:23:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:00,549 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2023-02-18 21:23:00,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2023-02-18 21:23:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 21:23:00,550 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:00,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:23:00,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:00,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:00,950 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 21:23:00,951 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 631952143, now seen corresponding path program 1 times [2023-02-18 21:23:00,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020439504] [2023-02-18 21:23:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:00,951 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-18 21:23:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:00,953 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-18 21:23:00,955 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-18 21:23:01,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:01,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 21:23:01,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:01,022 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-18 21:23:01,025 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-18 21:23:01,037 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-18 21:23:01,039 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-18 21:23:01,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:01,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:01,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:01,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020439504] [2023-02-18 21:23:01,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020439504] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:01,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:01,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 21:23:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822021304] [2023-02-18 21:23:01,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:01,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:23:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:01,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:23:01,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:23:01,049 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:01,113 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2023-02-18 21:23:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:23:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2023-02-18 21:23:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:01,114 INFO L225 Difference]: With dead ends: 93 [2023-02-18 21:23:01,114 INFO L226 Difference]: Without dead ends: 87 [2023-02-18 21:23:01,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:23:01,115 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:01,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:23:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-18 21:23:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-18 21:23:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 76 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-02-18 21:23:01,117 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 26 [2023-02-18 21:23:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:01,117 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-02-18 21:23:01,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-02-18 21:23:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 21:23:01,117 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:01,117 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:23:01,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:01,324 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-18 21:23:01,325 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1765464909, now seen corresponding path program 1 times [2023-02-18 21:23:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:01,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243790749] [2023-02-18 21:23:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:01,326 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-18 21:23:01,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:01,327 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-18 21:23:01,360 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-18 21:23:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:01,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 21:23:01,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:23:01,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:01,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:01,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243790749] [2023-02-18 21:23:01,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243790749] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:01,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:01,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:23:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503132928] [2023-02-18 21:23:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:01,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:23:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:01,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:23:01,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:23:01,409 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:01,525 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2023-02-18 21:23:01,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 21:23:01,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-02-18 21:23:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:01,526 INFO L225 Difference]: With dead ends: 98 [2023-02-18 21:23:01,527 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 21:23:01,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-18 21:23:01,527 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 120 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:01,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:23:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 21:23:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2023-02-18 21:23:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 66 states have (on average 1.378787878787879) internal successors, (91), 79 states have internal predecessors, (91), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2023-02-18 21:23:01,530 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 27 [2023-02-18 21:23:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:01,530 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2023-02-18 21:23:01,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2023-02-18 21:23:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-18 21:23:01,531 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:01,531 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:23:01,537 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 (20)] Ended with exit code 0 [2023-02-18 21:23:01,731 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-18 21:23:01,731 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:01,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1765464908, now seen corresponding path program 1 times [2023-02-18 21:23:01,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:01,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596640760] [2023-02-18 21:23:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:01,732 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-18 21:23:01,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:01,733 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-18 21:23:01,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-18 21:23:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:01,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 21:23:01,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:01,842 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-18 21:23:01,865 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_325 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_325))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-18 21:23:01,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:01,874 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 16 treesize of output 18 [2023-02-18 21:23:01,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:23:01,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 21:23:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:01,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:01,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:01,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596640760] [2023-02-18 21:23:01,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596640760] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:01,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:01,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:23:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665488328] [2023-02-18 21:23:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:01,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:23:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:01,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:23:01,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-18 21:23:01,899 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:02,198 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2023-02-18 21:23:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 21:23:02,199 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-02-18 21:23:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:02,199 INFO L225 Difference]: With dead ends: 123 [2023-02-18 21:23:02,200 INFO L226 Difference]: Without dead ends: 123 [2023-02-18 21:23:02,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=90, Unknown=1, NotChecked=20, Total=156 [2023-02-18 21:23:02,200 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:02,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 193 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 0 Unknown, 117 Unchecked, 0.3s Time] [2023-02-18 21:23:02,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-18 21:23:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2023-02-18 21:23:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 78 states have internal predecessors, (89), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-02-18 21:23:02,202 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 27 [2023-02-18 21:23:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:02,203 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-02-18 21:23:02,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-02-18 21:23:02,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 21:23:02,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:02,203 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:02,213 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-18 21:23:02,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:23:02,410 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:02,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1104559937, now seen corresponding path program 1 times [2023-02-18 21:23:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:02,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539392353] [2023-02-18 21:23:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:23:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:02,425 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:23:02,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-18 21:23:02,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:02,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 21:23:02,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:02,505 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 11 treesize of output 7 [2023-02-18 21:23:02,530 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 15 treesize of output 7 [2023-02-18 21:23:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 21:23:02,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:02,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:02,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539392353] [2023-02-18 21:23:02,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539392353] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:02,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:02,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 21:23:02,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560554396] [2023-02-18 21:23:02,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:02,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 21:23:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:02,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 21:23:02,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-18 21:23:02,540 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:02,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:02,686 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-18 21:23:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 21:23:02,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-18 21:23:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:02,687 INFO L225 Difference]: With dead ends: 91 [2023-02-18 21:23:02,687 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 21:23:02,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-18 21:23:02,688 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 83 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:02,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 302 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:23:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 21:23:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2023-02-18 21:23:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 78 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2023-02-18 21:23:02,690 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2023-02-18 21:23:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:02,690 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2023-02-18 21:23:02,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2023-02-18 21:23:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-18 21:23:02,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:02,691 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:02,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:02,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:23:02,897 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1105162709, now seen corresponding path program 1 times [2023-02-18 21:23:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:02,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545263073] [2023-02-18 21:23:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:02,898 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-18 21:23:02,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:02,899 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-18 21:23:02,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 (23)] Waiting until timeout for monitored process [2023-02-18 21:23:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:02,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 21:23:02,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:02,988 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-18 21:23:03,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:03,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 21:23:03,080 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-18 21:23:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:03,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:05,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:05,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545263073] [2023-02-18 21:23:05,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545263073] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:05,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [759143806] [2023-02-18 21:23:05,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:05,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:23:05,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:23:05,184 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:23:05,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-18 21:23:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:05,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 21:23:05,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:05,307 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-18 21:23:05,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:05,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 21:23:05,353 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-18 21:23:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:05,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:07,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [759143806] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:07,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:23:07,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-18 21:23:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365084354] [2023-02-18 21:23:07,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:23:07,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 21:23:07,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 21:23:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2023-02-18 21:23:07,416 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:07,631 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2023-02-18 21:23:07,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 21:23:07,632 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-18 21:23:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:07,633 INFO L225 Difference]: With dead ends: 92 [2023-02-18 21:23:07,633 INFO L226 Difference]: Without dead ends: 92 [2023-02-18 21:23:07,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=102, Invalid=317, Unknown=1, NotChecked=0, Total=420 [2023-02-18 21:23:07,633 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 143 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:07,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 222 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:23:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-18 21:23:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2023-02-18 21:23:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2023-02-18 21:23:07,635 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 28 [2023-02-18 21:23:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:07,635 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2023-02-18 21:23:07,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2023-02-18 21:23:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 21:23:07,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:07,636 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:23:07,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:07,848 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-18 21:23:08,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-18 21:23:08,039 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:08,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:08,039 INFO L85 PathProgramCache]: Analyzing trace with hash -118380194, now seen corresponding path program 1 times [2023-02-18 21:23:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:08,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108572883] [2023-02-18 21:23:08,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:08,040 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-18 21:23:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:08,041 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-18 21:23:08,043 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-18 21:23:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:08,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 21:23:08,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:08,201 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 11 treesize of output 7 [2023-02-18 21:23:08,307 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 15 treesize of output 7 [2023-02-18 21:23:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:08,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:08,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:08,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108572883] [2023-02-18 21:23:08,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108572883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:08,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:08,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 21:23:08,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350526911] [2023-02-18 21:23:08,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:08,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 21:23:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 21:23:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-18 21:23:08,342 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:09,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:09,209 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-02-18 21:23:09,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 21:23:09,210 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-02-18 21:23:09,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:09,211 INFO L225 Difference]: With dead ends: 89 [2023-02-18 21:23:09,211 INFO L226 Difference]: Without dead ends: 89 [2023-02-18 21:23:09,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-02-18 21:23:09,212 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 96 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:09,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 234 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 21:23:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-18 21:23:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-02-18 21:23:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.303030303030303) internal successors, (86), 77 states have internal predecessors, (86), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:09,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2023-02-18 21:23:09,214 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 29 [2023-02-18 21:23:09,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:09,214 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2023-02-18 21:23:09,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2023-02-18 21:23:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 21:23:09,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:09,214 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:23:09,221 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-18 21:23:09,415 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-18 21:23:09,415 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:09,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -99262379, now seen corresponding path program 1 times [2023-02-18 21:23:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:09,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195534629] [2023-02-18 21:23:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:23:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:09,417 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-18 21:23:09,418 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-18 21:23:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:09,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 21:23:09,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:23:09,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:09,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:09,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195534629] [2023-02-18 21:23:09,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195534629] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:09,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:09,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:23:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833890960] [2023-02-18 21:23:09,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:09,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:23:09,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:09,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:23:09,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:23:09,490 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:09,521 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2023-02-18 21:23:09,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:23:09,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2023-02-18 21:23:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:09,522 INFO L225 Difference]: With dead ends: 103 [2023-02-18 21:23:09,523 INFO L226 Difference]: Without dead ends: 103 [2023-02-18 21:23:09,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:23:09,523 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:09,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 174 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:23:09,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-18 21:23:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2023-02-18 21:23:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 77 states have internal predecessors, (85), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-18 21:23:09,525 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2023-02-18 21:23:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:09,525 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-18 21:23:09,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-18 21:23:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-18 21:23:09,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:09,526 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:23:09,550 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-18 21:23:09,726 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-18 21:23:09,727 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:09,727 INFO L85 PathProgramCache]: Analyzing trace with hash -99694285, now seen corresponding path program 1 times [2023-02-18 21:23:09,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:09,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665192805] [2023-02-18 21:23:09,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:09,728 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-18 21:23:09,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:09,729 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-18 21:23:09,732 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-18 21:23:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:09,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 21:23:09,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:09,841 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-18 21:23:09,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:09,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 21:23:10,006 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-18 21:23:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:10,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:12,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:12,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665192805] [2023-02-18 21:23:12,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665192805] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:12,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [721790038] [2023-02-18 21:23:12,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:12,249 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:23:12,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:23:12,250 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:23:12,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-18 21:23:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:12,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 21:23:12,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:12,382 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-18 21:23:12,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:12,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-18 21:23:12,445 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-18 21:23:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:12,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:14,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [721790038] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:14,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:23:14,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-18 21:23:14,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796089145] [2023-02-18 21:23:14,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:23:14,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 21:23:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:14,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 21:23:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2023-02-18 21:23:14,538 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:14,862 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-02-18 21:23:14,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 21:23:14,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-02-18 21:23:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:14,864 INFO L225 Difference]: With dead ends: 91 [2023-02-18 21:23:14,864 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 21:23:14,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2023-02-18 21:23:14,865 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 105 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:14,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 221 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 21:23:14,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 21:23:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-02-18 21:23:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 76 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2023-02-18 21:23:14,867 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 29 [2023-02-18 21:23:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:14,867 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2023-02-18 21:23:14,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2023-02-18 21:23:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 21:23:14,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:14,868 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:14,875 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-18 21:23:15,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:15,268 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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 21:23:15,268 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash 625181411, now seen corresponding path program 1 times [2023-02-18 21:23:15,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:15,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892976469] [2023-02-18 21:23:15,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23: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-18 21:23:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:15,270 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-18 21:23:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-18 21:23:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:15,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 21:23:15,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:15,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-18 21:23:15,363 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 11 treesize of output 7 [2023-02-18 21:23:15,390 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 17 treesize of output 9 [2023-02-18 21:23:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 21:23:15,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:15,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:15,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892976469] [2023-02-18 21:23:15,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892976469] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:15,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:15,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 21:23:15,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696319167] [2023-02-18 21:23:15,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:15,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 21:23:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 21:23:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-18 21:23:15,401 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:15,636 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-02-18 21:23:15,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 21:23:15,637 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2023-02-18 21:23:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:15,637 INFO L225 Difference]: With dead ends: 99 [2023-02-18 21:23:15,637 INFO L226 Difference]: Without dead ends: 99 [2023-02-18 21:23:15,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-18 21:23:15,638 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 63 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:15,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 252 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:23:15,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-18 21:23:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2023-02-18 21:23:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 80 states have internal predecessors, (89), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-18 21:23:15,640 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 30 [2023-02-18 21:23:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:15,640 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-18 21:23:15,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-18 21:23:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 21:23:15,641 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:15,641 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:15,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:15,850 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-18 21:23:15,850 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:15,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1978491108, now seen corresponding path program 1 times [2023-02-18 21:23:15,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:15,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252661222] [2023-02-18 21:23:15,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:15,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-18 21:23:15,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:15,852 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-18 21:23:15,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 (30)] Waiting until timeout for monitored process [2023-02-18 21:23:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:15,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 21:23:15,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:15,934 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 11 treesize of output 7 [2023-02-18 21:23:15,938 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 11 treesize of output 7 [2023-02-18 21:23:15,947 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 15 treesize of output 7 [2023-02-18 21:23:15,949 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 15 treesize of output 7 [2023-02-18 21:23:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 21:23:15,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:15,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:15,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252661222] [2023-02-18 21:23:15,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252661222] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:15,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:15,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 21:23:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378929478] [2023-02-18 21:23:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:15,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:23:15,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:15,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:23:15,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:23:15,958 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:16,031 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-18 21:23:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 21:23:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-18 21:23:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:16,033 INFO L225 Difference]: With dead ends: 113 [2023-02-18 21:23:16,033 INFO L226 Difference]: Without dead ends: 113 [2023-02-18 21:23:16,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:23:16,033 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 29 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:16,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 352 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 21:23:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-18 21:23:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2023-02-18 21:23:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 78 states have internal predecessors, (86), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-18 21:23:16,035 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 30 [2023-02-18 21:23:16,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:16,035 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-18 21:23:16,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:16,035 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-18 21:23:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 21:23:16,036 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:16,036 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:16,044 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-18 21:23:16,236 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-18 21:23:16,237 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:16,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1615411610, now seen corresponding path program 1 times [2023-02-18 21:23:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:16,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432528357] [2023-02-18 21:23:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:16,238 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-18 21:23:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:16,239 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-18 21:23:16,241 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-18 21:23:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:16,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 21:23:16,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:23:16,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:16,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:16,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432528357] [2023-02-18 21:23:16,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432528357] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:16,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:16,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 21:23:16,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064329615] [2023-02-18 21:23:16,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:16,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 21:23:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 21:23:16,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 21:23:16,321 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:16,338 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2023-02-18 21:23:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 21:23:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-18 21:23:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:16,339 INFO L225 Difference]: With dead ends: 96 [2023-02-18 21:23:16,339 INFO L226 Difference]: Without dead ends: 96 [2023-02-18 21:23:16,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:23:16,339 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 48 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:16,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 171 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:23:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-18 21:23:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2023-02-18 21:23:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 71 states have internal predecessors, (74), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 21:23:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-02-18 21:23:16,342 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 30 [2023-02-18 21:23:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:16,342 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-02-18 21:23:16,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-02-18 21:23:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 21:23:16,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:16,342 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:16,349 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-18 21:23:16,543 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-18 21:23:16,543 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:16,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:16,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1204444567, now seen corresponding path program 1 times [2023-02-18 21:23:16,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:16,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342430702] [2023-02-18 21:23:16,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:16,544 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-18 21:23:16,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:16,545 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-18 21:23:16,547 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-18 21:23:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:16,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 21:23:16,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:16,635 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-18 21:23:16,647 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-18 21:23:16,668 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 3 [2023-02-18 21:23:16,679 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_551 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_551))))) is different from true [2023-02-18 21:23:16,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:23:16,687 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 23 treesize of output 69 [2023-02-18 21:23:16,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:16,704 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 23 treesize of output 22 [2023-02-18 21:23:16,752 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 21 treesize of output 9 [2023-02-18 21:23:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-18 21:23:16,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:23,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342430702] [2023-02-18 21:23:23,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342430702] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [736041078] [2023-02-18 21:23:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:23:23,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:23:23,085 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:23:23,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-02-18 21:23:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:23,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-18 21:23:23,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:23,228 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-18 21:23:23,234 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-18 21:23:23,240 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 3 [2023-02-18 21:23:23,244 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-18 21:23:23,250 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:23:23,250 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 18 treesize of output 52 [2023-02-18 21:23:23,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:23,276 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 23 treesize of output 22 [2023-02-18 21:23:23,283 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 21 treesize of output 9 [2023-02-18 21:23:23,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-18 21:23:23,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:34,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [736041078] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:34,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:23:34,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2023-02-18 21:23:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161777680] [2023-02-18 21:23:34,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:23:34,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 21:23:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:34,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 21:23:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=8, NotChecked=58, Total=306 [2023-02-18 21:23:34,586 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 21:23:34,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:34,985 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2023-02-18 21:23:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 21:23:34,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-02-18 21:23:34,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:34,986 INFO L225 Difference]: With dead ends: 84 [2023-02-18 21:23:34,986 INFO L226 Difference]: Without dead ends: 84 [2023-02-18 21:23:34,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=97, Invalid=322, Unknown=9, NotChecked=78, Total=506 [2023-02-18 21:23:34,986 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:34,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 230 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 201 Invalid, 0 Unknown, 142 Unchecked, 0.3s Time] [2023-02-18 21:23:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-18 21:23:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-18 21:23:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.203125) internal successors, (77), 74 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 21:23:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2023-02-18 21:23:34,988 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 30 [2023-02-18 21:23:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:34,989 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2023-02-18 21:23:34,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 21:23:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2023-02-18 21:23:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-18 21:23:34,989 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:34,989 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:34,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:35,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:35,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-18 21:23:35,390 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash -584147051, now seen corresponding path program 1 times [2023-02-18 21:23:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:35,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583233432] [2023-02-18 21:23:35,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:35,390 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-18 21:23:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:35,391 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:23:35,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-18 21:23:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:35,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 21:23:35,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:23:35,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:35,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:35,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583233432] [2023-02-18 21:23:35,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583233432] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:35,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:35,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 21:23:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233012924] [2023-02-18 21:23:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:35,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 21:23:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:35,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 21:23:35,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 21:23:35,500 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:35,532 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2023-02-18 21:23:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 21:23:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-18 21:23:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:35,533 INFO L225 Difference]: With dead ends: 91 [2023-02-18 21:23:35,533 INFO L226 Difference]: Without dead ends: 91 [2023-02-18 21:23:35,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-18 21:23:35,534 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:35,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:23:35,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-18 21:23:35,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-02-18 21:23:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 77 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 21:23:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2023-02-18 21:23:35,536 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 30 [2023-02-18 21:23:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:35,536 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2023-02-18 21:23:35,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 21:23:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2023-02-18 21:23:35,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 21:23:35,536 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:35,536 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:35,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:35,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:23:35,737 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:35,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1451440213, now seen corresponding path program 1 times [2023-02-18 21:23:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:35,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136902996] [2023-02-18 21:23:35,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:35,738 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-18 21:23:35,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:35,739 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:23:35,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-18 21:23:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:35,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 21:23:35,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:35,828 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-18 21:23:35,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:23:35,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 21:23:35,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-18 21:23:37,886 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_21| (_ BitVec 32))) (not (= |v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_21| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_21|) (bvadd (_ bv4 32) (_ bv0 32)))))) is different from true [2023-02-18 21:23:37,889 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-18 21:23:37,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:37,916 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 21 [2023-02-18 21:23:37,952 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 20 treesize of output 8 [2023-02-18 21:23:37,974 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-18 21:23:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-18 21:23:38,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:23:38,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:23:38,199 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 58 treesize of output 62 [2023-02-18 21:23:38,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:38,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136902996] [2023-02-18 21:23:38,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136902996] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:23:38,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756982285] [2023-02-18 21:23:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:38,307 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:23:38,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:23:38,309 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:23:38,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-02-18 21:23:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:38,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 21:23:38,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:38,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:23:38,829 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-18 21:23:38,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:23:38,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:38,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [756982285] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:38,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 21:23:38,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2023-02-18 21:23:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846834193] [2023-02-18 21:23:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:38,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 21:23:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:38,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 21:23:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=633, Unknown=1, NotChecked=50, Total=756 [2023-02-18 21:23:38,969 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:39,573 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2023-02-18 21:23:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 21:23:39,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-02-18 21:23:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:39,575 INFO L225 Difference]: With dead ends: 97 [2023-02-18 21:23:39,575 INFO L226 Difference]: Without dead ends: 97 [2023-02-18 21:23:39,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=139, Invalid=1054, Unknown=1, NotChecked=66, Total=1260 [2023-02-18 21:23:39,576 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 150 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:39,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 175 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 21:23:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-18 21:23:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2023-02-18 21:23:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-02-18 21:23:39,579 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 33 [2023-02-18 21:23:39,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:39,579 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-02-18 21:23:39,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:39,579 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-02-18 21:23:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 21:23:39,580 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:39,580 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:39,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:39,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:39,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 21:23:39,989 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1451440214, now seen corresponding path program 1 times [2023-02-18 21:23:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:39,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794681005] [2023-02-18 21:23:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:39,990 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-18 21:23:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:39,992 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:23:39,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2023-02-18 21:23:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:40,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-18 21:23:40,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:23:40,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:40,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:40,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794681005] [2023-02-18 21:23:40,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794681005] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:40,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:40,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:23:40,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167311650] [2023-02-18 21:23:40,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:40,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:23:40,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:23:40,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 21:23:40,137 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:23:40,374 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2023-02-18 21:23:40,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 21:23:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-02-18 21:23:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:23:40,375 INFO L225 Difference]: With dead ends: 93 [2023-02-18 21:23:40,375 INFO L226 Difference]: Without dead ends: 93 [2023-02-18 21:23:40,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-18 21:23:40,375 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 107 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 21:23:40,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 189 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 21:23:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-18 21:23:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-02-18 21:23:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.173913043478261) internal successors, (81), 78 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:23:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2023-02-18 21:23:40,377 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 33 [2023-02-18 21:23:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:23:40,377 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2023-02-18 21:23:40,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:23:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2023-02-18 21:23:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 21:23:40,378 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:23:40,378 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:23:40,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2023-02-18 21:23:40,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:23:40,588 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:23:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:23:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1801348875, now seen corresponding path program 1 times [2023-02-18 21:23:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:23:40,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947856019] [2023-02-18 21:23:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:23:40,589 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-18 21:23:40,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:23:40,590 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:23:40,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-02-18 21:23:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:23:40,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 21:23:40,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:23:40,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:23:40,711 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 17 treesize of output 39 [2023-02-18 21:23:40,737 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 11 treesize of output 7 [2023-02-18 21:23:40,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2023-02-18 21:23:42,863 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_689 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) |c_f19_undo_#in~a.offset|) v_ArrVal_689))) (exists ((|v_ULTIMATE.start_probe_19_~a#1.base_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_probe_19_~a#1.offset_BEFORE_CALL_34| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_probe_19_~a#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_probe_19_~a#1.offset_BEFORE_CALL_34|) |v_ULTIMATE.start_probe_19_~a#1.base_BEFORE_CALL_31|)))) is different from true [2023-02-18 21:23:42,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:23:42,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 48 [2023-02-18 21:23:42,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2023-02-18 21:23:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:23:42,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:23:42,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:23:42,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947856019] [2023-02-18 21:23:42,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947856019] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:23:42,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:23:42,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 21:23:42,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27654810] [2023-02-18 21:23:42,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:23:42,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 21:23:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:23:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 21:23:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=82, Unknown=2, NotChecked=18, Total=132 [2023-02-18 21:23:42,895 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:23:44,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:23:46,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:23:48,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:23:50,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:23:52,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:23:55,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:23:57,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:23:59,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:01,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:03,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:05,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:07,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:09,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:11,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:13,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:24:13,256 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2023-02-18 21:24:13,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 21:24:13,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2023-02-18 21:24:13,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:24:13,259 INFO L225 Difference]: With dead ends: 88 [2023-02-18 21:24:13,259 INFO L226 Difference]: Without dead ends: 88 [2023-02-18 21:24:13,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=48, Invalid=136, Unknown=2, NotChecked=24, Total=210 [2023-02-18 21:24:13,259 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 48 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:24:13,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 156 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 15 Unknown, 78 Unchecked, 30.3s Time] [2023-02-18 21:24:13,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-18 21:24:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-18 21:24:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 77 states have internal predecessors, (80), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:24:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2023-02-18 21:24:13,261 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 33 [2023-02-18 21:24:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:24:13,261 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2023-02-18 21:24:13,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:24:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2023-02-18 21:24:13,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-18 21:24:13,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:24:13,262 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:24:13,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2023-02-18 21:24:13,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:24:13,463 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:24:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:24:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1801348876, now seen corresponding path program 1 times [2023-02-18 21:24:13,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:24:13,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632795458] [2023-02-18 21:24:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:24:13,463 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-18 21:24:13,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:24:13,464 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:24:13,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-02-18 21:24:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:24:13,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 21:24:13,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:24:13,585 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-18 21:24:13,608 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_710 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_710))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-18 21:24:13,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:24:13,619 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 16 treesize of output 18 [2023-02-18 21:24:13,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:24:13,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-18 21:24:13,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:24:13,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:24:13,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:24:13,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632795458] [2023-02-18 21:24:13,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632795458] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:24:13,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:24:13,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 21:24:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622036989] [2023-02-18 21:24:13,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:24:13,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 21:24:13,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:24:13,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 21:24:13,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=27, Unknown=1, NotChecked=10, Total=56 [2023-02-18 21:24:13,655 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:24:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:24:13,797 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-02-18 21:24:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 21:24:13,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2023-02-18 21:24:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:24:13,798 INFO L225 Difference]: With dead ends: 87 [2023-02-18 21:24:13,798 INFO L226 Difference]: Without dead ends: 87 [2023-02-18 21:24:13,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2023-02-18 21:24:13,799 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:24:13,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 86 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 87 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2023-02-18 21:24:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-18 21:24:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-18 21:24:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.144927536231884) internal successors, (79), 76 states have internal predecessors, (79), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-18 21:24:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2023-02-18 21:24:13,801 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 33 [2023-02-18 21:24:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:24:13,801 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2023-02-18 21:24:13,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:24:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2023-02-18 21:24:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-18 21:24:13,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:24:13,801 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:24:13,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2023-02-18 21:24:14,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:24:14,002 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:24:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:24:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1275833015, now seen corresponding path program 1 times [2023-02-18 21:24:14,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:24:14,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817465381] [2023-02-18 21:24:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:24:14,003 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-18 21:24:14,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:24:14,004 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:24:14,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-02-18 21:24:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:24:14,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 21:24:14,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:24:14,153 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-18 21:24:14,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:24:14,233 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 42 treesize of output 46 [2023-02-18 21:24:14,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:24:14,295 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 41 treesize of output 34 [2023-02-18 21:24:14,309 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 39 treesize of output 21 [2023-02-18 21:24:23,575 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_probe_19_#t~mem46#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| (_ BitVec 32)) (v_ArrVal_729 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| v_ArrVal_729))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7|)) (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_14| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_14|))))) is different from true [2023-02-18 21:24:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 21:24:23,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:24:25,763 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_733 (_ BitVec 32))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_f19_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_f19_~a#1.base|) |c_ULTIMATE.start_f19_~a#1.offset| v_ArrVal_733)) |c_ULTIMATE.start_probe_19_~a#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_probe_19_~a#1.offset|)) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~#a19~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-18 21:24:25,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:24:25,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817465381] [2023-02-18 21:24:25,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817465381] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:24:25,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [711838357] [2023-02-18 21:24:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:24:25,767 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:24:25,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:24:25,768 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:24:25,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-02-18 21:24:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:24:25,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-18 21:24:25,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:24:25,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:24:25,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-18 21:24:26,123 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-18 21:24:26,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:24:26,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:24:26,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:24:26,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:24:26,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2023-02-18 21:24:30,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:24:30,708 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 50 treesize of output 37 [2023-02-18 21:24:30,878 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 48 treesize of output 24 [2023-02-18 21:24:31,134 WARN L859 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| (_ bv0 32))) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#a19~0#1.base_8| (_ BitVec 32)) (|v_ULTIMATE.start_probe_19_#t~mem46#1.base_16| (_ BitVec 32)) (v_ArrVal_755 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_8| v_ArrVal_755))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_8|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_16|)) (bvult |v_ULTIMATE.start_probe_19_#t~mem46#1.base_16| |#StackHeapBarrier|) (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_16| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a19~0#1.base_8| (_ bv0 1))) (not (= (_ bv4294967295 32) |#StackHeapBarrier|)) (bvult |#StackHeapBarrier| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_8|))))) is different from true [2023-02-18 21:24:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:24:31,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:24:31,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_760 (_ BitVec 32))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_f19_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_f19_~a#1.base|) |c_ULTIMATE.start_f19_~a#1.offset| v_ArrVal_760)) |c_ULTIMATE.start_probe_19_~a#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_probe_19_~a#1.offset|)) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~#a19~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-18 21:24:31,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [711838357] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:24:31,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:24:31,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2023-02-18 21:24:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965722380] [2023-02-18 21:24:31,151 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:24:31,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-18 21:24:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:24:31,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-18 21:24:31,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=478, Unknown=11, NotChecked=188, Total=756 [2023-02-18 21:24:31,152 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 22 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 21:24:33,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:37,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:42,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:48,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:50,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:52,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:54,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:24:58,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:00,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:02,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:04,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:06,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:06,647 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2023-02-18 21:25:06,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 21:25:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 32 [2023-02-18 21:25:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:06,648 INFO L225 Difference]: With dead ends: 90 [2023-02-18 21:25:06,648 INFO L226 Difference]: Without dead ends: 72 [2023-02-18 21:25:06,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=175, Invalid=1158, Unknown=15, NotChecked=292, Total=1640 [2023-02-18 21:25:06,648 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 88 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 21 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:06,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 364 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 382 Invalid, 16 Unknown, 134 Unchecked, 25.3s Time] [2023-02-18 21:25:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-18 21:25:06,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-18 21:25:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 62 states have internal predecessors, (64), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 21:25:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2023-02-18 21:25:06,650 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 32 [2023-02-18 21:25:06,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:06,650 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2023-02-18 21:25:06,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 20 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 21:25:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2023-02-18 21:25:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-18 21:25:06,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:06,651 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:25:06,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-02-18 21:25:06,858 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 (40)] Ended with exit code 0 [2023-02-18 21:25:07,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:07,052 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:25:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2044973706, now seen corresponding path program 1 times [2023-02-18 21:25:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:07,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000017707] [2023-02-18 21:25:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:07,052 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-18 21:25:07,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:07,053 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:25:07,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-18 21:25:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:07,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-18 21:25:07,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:07,172 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 11 treesize of output 7 [2023-02-18 21:25:07,234 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 15 treesize of output 7 [2023-02-18 21:25:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 21:25:07,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:07,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:07,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000017707] [2023-02-18 21:25:07,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000017707] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:07,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:07,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-18 21:25:07,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198852927] [2023-02-18 21:25:07,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:07,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 21:25:07,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 21:25:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-18 21:25:07,254 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:25:07,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:07,603 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-02-18 21:25:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 21:25:07,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-02-18 21:25:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:07,604 INFO L225 Difference]: With dead ends: 75 [2023-02-18 21:25:07,604 INFO L226 Difference]: Without dead ends: 75 [2023-02-18 21:25:07,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-02-18 21:25:07,605 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 95 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:07,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 250 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 21:25:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-18 21:25:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2023-02-18 21:25:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 61 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 21:25:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2023-02-18 21:25:07,606 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 34 [2023-02-18 21:25:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:07,607 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2023-02-18 21:25:07,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:25:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2023-02-18 21:25:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-18 21:25:07,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:07,607 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-18 21:25:07,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:07,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 21:25:07,808 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:25:07,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:07,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1030324427, now seen corresponding path program 1 times [2023-02-18 21:25:07,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:07,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178648056] [2023-02-18 21:25:07,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:07,808 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-18 21:25:07,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:07,809 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 21:25:07,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-02-18 21:25:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:07,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 21:25:07,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:08,020 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 11 treesize of output 7 [2023-02-18 21:25:08,198 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 15 treesize of output 7 [2023-02-18 21:25:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:25:08,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:08,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:08,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178648056] [2023-02-18 21:25:08,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178648056] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:08,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:08,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-18 21:25:08,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349678331] [2023-02-18 21:25:08,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:08,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 21:25:08,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:08,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 21:25:08,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-18 21:25:08,247 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:25:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:09,506 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2023-02-18 21:25:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-18 21:25:09,507 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2023-02-18 21:25:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:09,507 INFO L225 Difference]: With dead ends: 74 [2023-02-18 21:25:09,507 INFO L226 Difference]: Without dead ends: 74 [2023-02-18 21:25:09,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2023-02-18 21:25:09,508 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 113 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:09,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 184 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 21:25:09,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-18 21:25:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2023-02-18 21:25:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 60 states have internal predecessors, (62), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 21:25:09,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2023-02-18 21:25:09,509 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 35 [2023-02-18 21:25:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:09,510 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2023-02-18 21:25:09,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:25:09,510 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2023-02-18 21:25:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 21:25:09,510 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:09,510 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:25:09,518 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 (43)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:09,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-18 21:25:09,711 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:25:09,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:09,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1875286036, now seen corresponding path program 1 times [2023-02-18 21:25:09,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:09,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421938889] [2023-02-18 21:25:09,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:09,711 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-18 21:25:09,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:09,713 INFO L229 MonitoredProcess]: Starting monitored process 44 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-18 21:25:09,714 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 (44)] Waiting until timeout for monitored process [2023-02-18 21:25:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:09,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-18 21:25:09,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:09,817 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-18 21:25:09,834 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-18 21:25:09,866 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 3 [2023-02-18 21:25:09,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:09,899 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 23 treesize of output 69 [2023-02-18 21:25:09,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:09,929 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 65 treesize of output 40 [2023-02-18 21:25:10,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:10,042 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-18 21:25:10,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2023-02-18 21:25:10,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:10,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2023-02-18 21:25:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:25:10,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:10,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:10,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421938889] [2023-02-18 21:25:10,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421938889] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:10,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:10,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-18 21:25:10,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011016818] [2023-02-18 21:25:10,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:10,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 21:25:10,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:10,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 21:25:10,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-02-18 21:25:10,141 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:25:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:11,039 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2023-02-18 21:25:11,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-18 21:25:11,040 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-02-18 21:25:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:11,044 INFO L225 Difference]: With dead ends: 73 [2023-02-18 21:25:11,044 INFO L226 Difference]: Without dead ends: 73 [2023-02-18 21:25:11,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2023-02-18 21:25:11,045 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 67 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:11,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 287 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 21:25:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-18 21:25:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-18 21:25:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.1206896551724137) internal successors, (65), 63 states have internal predecessors, (65), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 21:25:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2023-02-18 21:25:11,063 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 36 [2023-02-18 21:25:11,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:11,064 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2023-02-18 21:25:11,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-18 21:25:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2023-02-18 21:25:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-18 21:25:11,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:11,065 INFO L195 NwaCegarLoop]: trace histogram [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-18 21:25:11,072 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 (44)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:11,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-18 21:25:11,265 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:25:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1632002513, now seen corresponding path program 1 times [2023-02-18 21:25:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:11,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133595251] [2023-02-18 21:25:11,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:11,266 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-18 21:25:11,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:11,267 INFO L229 MonitoredProcess]: Starting monitored process 45 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-18 21:25:11,269 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 (45)] Waiting until timeout for monitored process [2023-02-18 21:25:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:11,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 21:25:11,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:11,379 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-18 21:25:11,395 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-18 21:25:11,420 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 3 [2023-02-18 21:25:11,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:11,457 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 23 treesize of output 69 [2023-02-18 21:25:11,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:11,492 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 67 treesize of output 42 [2023-02-18 21:25:11,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 36 [2023-02-18 21:25:11,647 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_probe_19_~a#1.base_BEFORE_CALL_41| (_ BitVec 32))) (not (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_probe_19_~a#1.base_BEFORE_CALL_41|))) (= (select .cse0 (_ bv0 32)) (select .cse0 (bvadd (_ bv4 32) (_ bv0 32))))))) (exists ((v_ArrVal_856 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_f19_undo_#in~a.base|) |c_f19_undo_#in~a.offset|) v_ArrVal_856)))) is different from true [2023-02-18 21:25:11,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2023-02-18 21:25:11,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:11,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 29 [2023-02-18 21:25:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:25:11,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:25:11,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:11,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133595251] [2023-02-18 21:25:11,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133595251] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:25:11,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1004859497] [2023-02-18 21:25:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:11,833 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-18 21:25:11,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-18 21:25:11,834 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-18 21:25:11,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-02-18 21:25:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:12,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-18 21:25:12,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:12,015 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-18 21:25:12,027 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-18 21:25:12,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-02-18 21:25:12,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:12,055 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 23 treesize of output 69 [2023-02-18 21:25:12,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:12,088 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 67 treesize of output 42 [2023-02-18 21:25:12,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 36 [2023-02-18 21:25:12,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2023-02-18 21:25:12,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:12,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 29 [2023-02-18 21:25:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 21:25:12,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 21:25:12,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1004859497] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 21:25:12,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 21:25:12,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2023-02-18 21:25:12,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304800758] [2023-02-18 21:25:12,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 21:25:12,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 21:25:12,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:12,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 21:25:12,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=243, Unknown=9, NotChecked=32, Total=342 [2023-02-18 21:25:12,324 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 21:25:13,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:13,008 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2023-02-18 21:25:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 21:25:13,008 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2023-02-18 21:25:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:13,008 INFO L225 Difference]: With dead ends: 72 [2023-02-18 21:25:13,009 INFO L226 Difference]: Without dead ends: 72 [2023-02-18 21:25:13,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=103, Invalid=440, Unknown=13, NotChecked=44, Total=600 [2023-02-18 21:25:13,009 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 51 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 5 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:13,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 245 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 274 Invalid, 32 Unknown, 56 Unchecked, 0.6s Time] [2023-02-18 21:25:13,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-18 21:25:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-18 21:25:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.103448275862069) internal successors, (64), 62 states have internal predecessors, (64), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 21:25:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2023-02-18 21:25:13,011 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 36 [2023-02-18 21:25:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:13,011 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2023-02-18 21:25:13,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-18 21:25:13,011 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2023-02-18 21:25:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-18 21:25:13,011 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:13,011 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-02-18 21:25:13,021 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 (45)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:13,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:13,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-18 21:25:13,412 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:25:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1333538260, now seen corresponding path program 1 times [2023-02-18 21:25:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:13,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83135595] [2023-02-18 21:25:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:13,413 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-18 21:25:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:13,414 INFO L229 MonitoredProcess]: Starting monitored process 47 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-18 21:25:13,416 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 (47)] Waiting until timeout for monitored process [2023-02-18 21:25:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:13,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 21:25:13,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:25:13,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:13,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:13,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83135595] [2023-02-18 21:25:13,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83135595] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:13,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:13,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 21:25:13,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532228833] [2023-02-18 21:25:13,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:13,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 21:25:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:13,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 21:25:13,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 21:25:13,528 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 21:25:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:13,558 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2023-02-18 21:25:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 21:25:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-02-18 21:25:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:13,559 INFO L225 Difference]: With dead ends: 62 [2023-02-18 21:25:13,559 INFO L226 Difference]: Without dead ends: 62 [2023-02-18 21:25:13,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 21:25:13,559 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 15 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:13,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 172 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 21:25:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-18 21:25:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2023-02-18 21:25:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 21:25:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2023-02-18 21:25:13,561 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 40 [2023-02-18 21:25:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:13,561 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2023-02-18 21:25:13,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-18 21:25:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2023-02-18 21:25:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 21:25:13,561 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:13,561 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-02-18 21:25:13,570 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 (47)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:13,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-18 21:25:13,762 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:25:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash 221296187, now seen corresponding path program 1 times [2023-02-18 21:25:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:13,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281246004] [2023-02-18 21:25:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:13,763 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-18 21:25:13,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:13,764 INFO L229 MonitoredProcess]: Starting monitored process 48 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-18 21:25:13,766 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 (48)] Waiting until timeout for monitored process [2023-02-18 21:25:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:13,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-18 21:25:13,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:13,934 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-18 21:25:13,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:13,989 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 42 treesize of output 46 [2023-02-18 21:25:14,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:14,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2023-02-18 21:25:14,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:14,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 166 [2023-02-18 21:25:14,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:14,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 75 [2023-02-18 21:25:25,747 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| (_ BitVec 32)) (v_ArrVal_934 (_ BitVec 1)) (v_ArrVal_931 (_ BitVec 1)) (v_ArrVal_930 (_ BitVec 1)) (v_arrayElimCell_122 (_ BitVec 32)) (v_arrayElimCell_121 (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| v_ArrVal_930))) (let ((.cse2 (store .cse1 v_arrayElimCell_122 v_ArrVal_931))) (let ((.cse0 (store (store .cse2 v_arrayElimCell_121 v_ArrVal_934) v_arrayElimCell_122 (_ bv0 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9|)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_121 (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| (_ bv0 1))) (= (_ bv0 1) (select .cse1 v_arrayElimCell_122)) (= (_ bv0 1) (select .cse2 v_arrayElimCell_121)) (= (_ bv1 1) (select .cse0 v_arrayElimCell_121)) (not (= (_ bv0 32) v_arrayElimCell_121))))))) is different from true [2023-02-18 21:25:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 21:25:25,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:25,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:25,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281246004] [2023-02-18 21:25:25,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281246004] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:25,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:25,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-02-18 21:25:25,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756792578] [2023-02-18 21:25:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:25,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-18 21:25:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:25,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-18 21:25:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=295, Unknown=6, NotChecked=34, Total=380 [2023-02-18 21:25:25,758 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 20 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:25:27,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:34,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:36,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:37,217 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2023-02-18 21:25:37,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 21:25:37,217 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2023-02-18 21:25:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:37,218 INFO L225 Difference]: With dead ends: 61 [2023-02-18 21:25:37,218 INFO L226 Difference]: Without dead ends: 43 [2023-02-18 21:25:37,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=87, Invalid=611, Unknown=8, NotChecked=50, Total=756 [2023-02-18 21:25:37,218 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:37,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 250 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 2 Unknown, 60 Unchecked, 6.6s Time] [2023-02-18 21:25:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-18 21:25:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-18 21:25:37,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.0) internal successors, (36), 36 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:25:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2023-02-18 21:25:37,220 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 42 [2023-02-18 21:25:37,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:37,220 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2023-02-18 21:25:37,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:25:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2023-02-18 21:25:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-18 21:25:37,220 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 21:25:37,220 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2023-02-18 21:25:37,233 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 (48)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:37,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-18 21:25:37,421 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-18 21:25:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 21:25:37,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1630446902, now seen corresponding path program 1 times [2023-02-18 21:25:37,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 21:25:37,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61188126] [2023-02-18 21:25:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 21:25:37,421 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-18 21:25:37,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 21:25:37,424 INFO L229 MonitoredProcess]: Starting monitored process 49 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-18 21:25:37,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 (49)] Waiting until timeout for monitored process [2023-02-18 21:25:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 21:25:37,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-18 21:25:37,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 21:25:37,585 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-18 21:25:37,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:37,664 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 42 treesize of output 46 [2023-02-18 21:25:37,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-18 21:25:37,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2023-02-18 21:25:37,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:37,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 166 [2023-02-18 21:25:37,994 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-18 21:25:37,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 35 [2023-02-18 21:25:48,161 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_962 (_ BitVec 1)) (v_ArrVal_961 (_ BitVec 1)) (|v_ULTIMATE.start_entry_point_~#a19~0#1.base_10| (_ BitVec 32)) (v_arrayElimCell_131 (_ BitVec 32)) (|v_ULTIMATE.start_probe_19_#t~mem46#1.base_20| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_10| v_ArrVal_961))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_20| v_ArrVal_962))) (and (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_131 (_ bv0 1)) |v_ULTIMATE.start_probe_19_#t~mem46#1.base_20| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a19~0#1.base_10| (_ bv0 1))) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_20|)) (= (_ bv0 1) (select .cse0 v_arrayElimCell_131)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_10|)))))) is different from true [2023-02-18 21:25:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-18 21:25:48,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 21:25:48,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 21:25:48,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61188126] [2023-02-18 21:25:48,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61188126] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 21:25:48,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 21:25:48,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-18 21:25:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40768647] [2023-02-18 21:25:48,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 21:25:48,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-18 21:25:48,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 21:25:48,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-18 21:25:48,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=202, Unknown=6, NotChecked=28, Total=272 [2023-02-18 21:25:48,164 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:25:50,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:54,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-18 21:25:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 21:25:54,721 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2023-02-18 21:25:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 21:25:54,722 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2023-02-18 21:25:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 21:25:54,722 INFO L225 Difference]: With dead ends: 42 [2023-02-18 21:25:54,723 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 21:25:54,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=62, Invalid=356, Unknown=6, NotChecked=38, Total=462 [2023-02-18 21:25:54,723 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-02-18 21:25:54,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 165 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 4 Unknown, 46 Unchecked, 4.9s Time] [2023-02-18 21:25:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 21:25:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 21:25:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 21:25:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 21:25:54,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2023-02-18 21:25:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 21:25:54,724 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 21:25:54,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-18 21:25:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 21:25:54,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 24 remaining) [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-02-18 21:25:54,726 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (13 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (12 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (11 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (8 of 24 remaining) [2023-02-18 21:25:54,727 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (7 of 24 remaining) [2023-02-18 21:25:54,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (6 of 24 remaining) [2023-02-18 21:25:54,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-02-18 21:25:54,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2023-02-18 21:25:54,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2023-02-18 21:25:54,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (2 of 24 remaining) [2023-02-18 21:25:54,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE (1 of 24 remaining) [2023-02-18 21:25:54,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE (0 of 24 remaining) [2023-02-18 21:25:54,736 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 (49)] Forceful destruction successful, exit code 0 [2023-02-18 21:25:54,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-18 21:25:54,938 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 21:25:54,939 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 21:25:54,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:25:54 BoogieIcfgContainer [2023-02-18 21:25:54,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 21:25:54,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 21:25:54,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 21:25:54,947 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 21:25:54,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:22:39" (3/4) ... [2023-02-18 21:25:54,949 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-18 21:25:54,955 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-02-18 21:25:54,955 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f19_undo [2023-02-18 21:25:54,976 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-02-18 21:25:54,976 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-18 21:25:54,977 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-18 21:25:55,009 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 21:25:55,010 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 21:25:55,010 INFO L158 Benchmark]: Toolchain (without parser) took 195949.58ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 78.1MB in the beginning and 87.4MB in the end (delta: -9.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2023-02-18 21:25:55,010 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 45.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 21:25:55,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.66ms. Allocated memory is still 102.8MB. Free memory was 77.6MB in the beginning and 48.5MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-02-18 21:25:55,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.71ms. Allocated memory is still 102.8MB. Free memory was 48.5MB in the beginning and 46.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 21:25:55,011 INFO L158 Benchmark]: Boogie Preprocessor took 41.80ms. Allocated memory is still 102.8MB. Free memory was 46.0MB in the beginning and 44.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 21:25:55,011 INFO L158 Benchmark]: RCFGBuilder took 357.73ms. Allocated memory is still 102.8MB. Free memory was 44.2MB in the beginning and 66.8MB in the end (delta: -22.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2023-02-18 21:25:55,011 INFO L158 Benchmark]: TraceAbstraction took 195057.57ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 66.0MB in the beginning and 91.4MB in the end (delta: -25.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-02-18 21:25:55,011 INFO L158 Benchmark]: Witness Printer took 63.45ms. Allocated memory is still 132.1MB. Free memory was 90.5MB in the beginning and 87.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-18 21:25:55,014 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 45.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.66ms. Allocated memory is still 102.8MB. Free memory was 77.6MB in the beginning and 48.5MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.71ms. Allocated memory is still 102.8MB. Free memory was 48.5MB in the beginning and 46.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.80ms. Allocated memory is still 102.8MB. Free memory was 46.0MB in the beginning and 44.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 357.73ms. Allocated memory is still 102.8MB. Free memory was 44.2MB in the beginning and 66.8MB in the end (delta: -22.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * TraceAbstraction took 195057.57ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 66.0MB in the beginning and 91.4MB in the end (delta: -25.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 63.45ms. Allocated memory is still 132.1MB. Free memory was 90.5MB in the beginning and 87.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 789]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 789]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 789]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 794]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 794]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 794]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 804]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 768]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 768]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 768]: free always succeeds For all program executions holds that free always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 70 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 195.0s, OverallIterations: 39, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 95.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 mSolverCounterUnknown, 3167 SdHoareTripleChecker+Valid, 76.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3132 mSDsluCounter, 8772 SdHoareTripleChecker+Invalid, 75.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1283 IncrementalHoareTripleChecker+Unchecked, 6715 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5434 IncrementalHoareTripleChecker+Invalid, 7120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 2057 mSDtfsCounter, 5434 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1668 GetRequests, 1119 SyntacticMatches, 50 SemanticMatches, 499 ConstructedPredicates, 18 IntricatePredicates, 1 DeprecatedPredicates, 1788 ImplicationChecksByTransitivity, 101.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=14, InterpolantAutomatonStates: 413, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 568 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 85.1s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1289 ConstructedInterpolants, 272 QuantifiedInterpolants, 17436 SizeOfPredicates, 490 NumberOfNonLiveVariables, 5883 ConjunctsInSsa, 900 ConjunctsInUnsatCore, 48 InterpolantComputations, 31 PerfectInterpolantSequences, 132/172 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-02-18 21:25:55,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE