./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 26d01a9c 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-?-26d01a9 [2023-02-17 03:08:01,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:08:01,388 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:08:01,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:08:01,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:08:01,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:08:01,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:08:01,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:08:01,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:08:01,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:08:01,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:08:01,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:08:01,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:08:01,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:08:01,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:08:01,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:08:01,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:08:01,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:08:01,441 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:08:01,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:08:01,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:08:01,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:08:01,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:08:01,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:08:01,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:08:01,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:08:01,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:08:01,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:08:01,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:08:01,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:08:01,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:08:01,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:08:01,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:08:01,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:08:01,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:08:01,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:08:01,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:08:01,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:08:01,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:08:01,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:08:01,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:08:01,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 03:08:01,490 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:08:01,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:08:01,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:08:01,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:08:01,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:08:01,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:08:01,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:08:01,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:08:01,492 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:08:01,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:08:01,493 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:08:01,493 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:08:01,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:08:01,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:08:01,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:08:01,494 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:08:01,494 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:08:01,494 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:08:01,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:08:01,495 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:08:01,495 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:08:01,495 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:08:01,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:08:01,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:08:01,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:08:01,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:08:01,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:08:01,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:08:01,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:08:01,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:08:01,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:08:01,497 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:08:01,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:08:01,497 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:08:01,497 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-17 03:08:01,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:08:01,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:08:01,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:08:01,720 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:08:01,720 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:08:01,721 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-17 03:08:02,726 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:08:02,948 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:08:02,949 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2023-02-17 03:08:02,957 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff16fa41/bbc1729cffb74cc7aa107604e7a7fb3f/FLAG14cf7cb17 [2023-02-17 03:08:02,966 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cff16fa41/bbc1729cffb74cc7aa107604e7a7fb3f [2023-02-17 03:08:02,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:08:02,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:08:02,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:08:02,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:08:02,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:08:02,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:08:02" (1/1) ... [2023-02-17 03:08:02,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377e90b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:02, skipping insertion in model container [2023-02-17 03:08:02,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:08:02" (1/1) ... [2023-02-17 03:08:02,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:08:03,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:08:03,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:08:03,282 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-17 03:08:03,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4354718f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:03, skipping insertion in model container [2023-02-17 03:08:03,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:08:03,284 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 03:08:03,286 INFO L158 Benchmark]: Toolchain (without parser) took 315.81ms. Allocated memory is still 226.5MB. Free memory was 176.8MB in the beginning and 162.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 03:08:03,286 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:08:03,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.09ms. Allocated memory is still 226.5MB. Free memory was 175.8MB in the beginning and 162.1MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 03:08:03,288 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.15ms. Allocated memory is still 146.8MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.09ms. Allocated memory is still 226.5MB. Free memory was 175.8MB in the beginning and 162.1MB in the end (delta: 13.7MB). 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-?-26d01a9 [2023-02-17 03:08:04,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:08:04,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:08:04,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:08:04,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:08:04,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:08:04,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:08:04,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:08:04,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:08:04,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:08:04,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:08:04,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:08:04,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:08:04,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:08:04,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:08:04,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:08:04,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:08:04,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:08:04,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:08:04,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:08:04,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:08:04,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:08:04,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:08:04,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:08:04,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:08:04,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:08:04,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:08:04,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:08:04,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:08:04,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:08:04,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:08:04,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:08:04,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:08:04,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:08:04,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:08:04,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:08:04,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:08:04,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:08:04,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:08:04,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:08:04,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:08:04,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 03:08:04,953 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:08:04,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:08:04,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:08:04,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:08:04,955 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:08:04,955 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:08:04,956 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:08:04,956 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:08:04,956 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:08:04,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:08:04,957 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:08:04,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:08:04,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:08:04,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:08:04,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:08:04,957 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:08:04,957 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:08:04,958 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:08:04,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:08:04,958 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:08:04,958 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 03:08:04,958 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 03:08:04,958 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:08:04,958 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:08:04,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:08:04,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:08:04,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:08:04,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:08:04,959 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:08:04,959 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:08:04,959 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 03:08:04,959 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 03:08:04,960 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:08:04,960 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:08:04,960 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:08:04,960 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 03:08:04,960 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:08:04,960 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-17 03:08:05,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:08:05,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:08:05,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:08:05,259 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:08:05,260 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:08:05,260 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-17 03:08:06,319 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:08:06,638 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:08:06,644 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-1.i [2023-02-17 03:08:06,663 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba71557c2/06edc52763444e83a3f3e022db2b81dc/FLAG8a08c9601 [2023-02-17 03:08:06,872 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba71557c2/06edc52763444e83a3f3e022db2b81dc [2023-02-17 03:08:06,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:08:06,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:08:06,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:08:06,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:08:06,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:08:06,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:08:06" (1/1) ... [2023-02-17 03:08:06,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30efbbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:06, skipping insertion in model container [2023-02-17 03:08:06,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:08:06" (1/1) ... [2023-02-17 03:08:06,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:08:06,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:08:07,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:08:07,222 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 03:08:07,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:08:07,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:08:07,263 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:08:07,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:08:07,353 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:08:07,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07 WrapperNode [2023-02-17 03:08:07,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:08:07,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:08:07,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:08:07,355 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:08:07,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,400 INFO L138 Inliner]: procedures = 171, calls = 87, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 77 [2023-02-17 03:08:07,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:08:07,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:08:07,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:08:07,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:08:07,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,444 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,445 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:08:07,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:08:07,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:08:07,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:08:07,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (1/1) ... [2023-02-17 03:08:07,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:08:07,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:08:07,480 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-17 03:08:07,485 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-17 03:08:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2023-02-17 03:08:07,504 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2023-02-17 03:08:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-17 03:08:07,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-17 03:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 03:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 03:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 03:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 03:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 03:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 03:08:07,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 03:08:07,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:08:07,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:08:07,633 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:08:07,635 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:08:07,855 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:08:07,861 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:08:07,863 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 03:08:07,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:08:07 BoogieIcfgContainer [2023-02-17 03:08:07,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:08:07,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:08:07,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:08:07,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:08:07,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:08:06" (1/3) ... [2023-02-17 03:08:07,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103c1b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:08:07, skipping insertion in model container [2023-02-17 03:08:07,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:08:07" (2/3) ... [2023-02-17 03:08:07,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103c1b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:08:07, skipping insertion in model container [2023-02-17 03:08:07,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:08:07" (3/3) ... [2023-02-17 03:08:07,871 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19-1.i [2023-02-17 03:08:07,882 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:08:07,882 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-17 03:08:07,923 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:08:07,928 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;@6c467aa2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:08:07,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-17 03:08:07,932 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-17 03:08:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 03:08:07,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:07,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:08:07,938 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-17 03:08:07,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1461209413, now seen corresponding path program 1 times [2023-02-17 03:08:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260032166] [2023-02-17 03:08:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:07,950 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-17 03:08:07,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:07,953 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-17 03:08:07,954 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-17 03:08:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:08,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:08:08,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:08,058 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-17 03:08:08,076 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-17 03:08:08,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:08:08,084 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-17 03:08:08,096 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-17 03:08:08,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:08,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:08,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260032166] [2023-02-17 03:08:08,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260032166] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:08,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:08,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:08:08,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722067564] [2023-02-17 03:08:08,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:08,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:08:08,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:08:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-17 03:08:08,121 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-17 03:08:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:08,249 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2023-02-17 03:08:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:08:08,251 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-17 03:08:08,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:08,258 INFO L225 Difference]: With dead ends: 98 [2023-02-17 03:08:08,258 INFO L226 Difference]: Without dead ends: 96 [2023-02-17 03:08:08,260 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-17 03:08:08,266 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-17 03:08:08,267 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-17 03:08:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-17 03:08:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2023-02-17 03:08:08,291 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-17 03:08:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2023-02-17 03:08:08,294 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 8 [2023-02-17 03:08:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:08,312 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2023-02-17 03:08:08,312 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-17 03:08:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2023-02-17 03:08:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-17 03:08:08,314 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:08,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:08:08,338 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-17 03:08:08,521 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-17 03:08:08,522 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-17 03:08:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1461209414, now seen corresponding path program 1 times [2023-02-17 03:08:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20159395] [2023-02-17 03:08:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:08,523 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-17 03:08:08,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:08,525 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-17 03:08:08,527 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-17 03:08:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:08,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 03:08:08,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:08,595 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-17 03:08:08,597 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-17 03:08:08,611 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_13 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_13))))) is different from true [2023-02-17 03:08:08,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:08,623 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-17 03:08:08,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:08:08,626 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-17 03:08:08,630 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-17 03:08:08,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:08,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20159395] [2023-02-17 03:08:08,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20159395] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:08,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:08,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:08:08,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702139349] [2023-02-17 03:08:08,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:08,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:08,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:08,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:08,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-17 03:08:08,633 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-17 03:08:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:08,769 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2023-02-17 03:08:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:08:08,770 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-17 03:08:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:08,771 INFO L225 Difference]: With dead ends: 120 [2023-02-17 03:08:08,771 INFO L226 Difference]: Without dead ends: 120 [2023-02-17 03:08:08,771 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-17 03:08:08,772 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:08,772 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.1s Time] [2023-02-17 03:08:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-17 03:08:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2023-02-17 03:08:08,777 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-17 03:08:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2023-02-17 03:08:08,778 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 8 [2023-02-17 03:08:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:08,778 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2023-02-17 03:08:08,778 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-17 03:08:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2023-02-17 03:08:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 03:08:08,779 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:08,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:08:08,788 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-17 03:08:08,986 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-17 03:08:08,987 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-17 03:08:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1807662222, now seen corresponding path program 1 times [2023-02-17 03:08:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:08,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994943959] [2023-02-17 03:08:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:08,988 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-17 03:08:08,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:08,999 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-17 03:08:09,001 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-17 03:08:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:09,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:08:09,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:09,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 03:08:09,072 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-17 03:08:09,090 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-17 03:08:09,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:09,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:09,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994943959] [2023-02-17 03:08:09,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994943959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:09,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:09,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:08:09,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276181521] [2023-02-17 03:08:09,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:09,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:09,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:09,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:09,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:08:09,092 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-17 03:08:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:09,157 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2023-02-17 03:08:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:08:09,157 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-17 03:08:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:09,158 INFO L225 Difference]: With dead ends: 86 [2023-02-17 03:08:09,158 INFO L226 Difference]: Without dead ends: 86 [2023-02-17 03:08:09,158 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-17 03:08:09,159 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-17 03:08:09,159 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-17 03:08:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-17 03:08:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-02-17 03:08:09,163 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-17 03:08:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-02-17 03:08:09,164 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 15 [2023-02-17 03:08:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:09,164 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-02-17 03:08:09,164 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-17 03:08:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-02-17 03:08:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 03:08:09,165 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:09,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:08:09,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-17 03:08:09,372 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-17 03:08:09,372 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-17 03:08:09,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:09,373 INFO L85 PathProgramCache]: Analyzing trace with hash 690353715, now seen corresponding path program 1 times [2023-02-17 03:08:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:09,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287767302] [2023-02-17 03:08:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:09,374 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-17 03:08:09,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:09,378 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-17 03:08:09,380 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-17 03:08:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:09,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:08:09,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:09,479 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-17 03:08:09,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:09,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:09,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287767302] [2023-02-17 03:08:09,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287767302] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:09,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:09,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:08:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888202814] [2023-02-17 03:08:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:09,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:08:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:09,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:08:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:08:09,481 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-17 03:08:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:09,499 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2023-02-17 03:08:09,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:08:09,500 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-17 03:08:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:09,500 INFO L225 Difference]: With dead ends: 88 [2023-02-17 03:08:09,501 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 03:08:09,501 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-17 03:08:09,501 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-17 03:08:09,502 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-17 03:08:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 03:08:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-02-17 03:08:09,505 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-17 03:08:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2023-02-17 03:08:09,506 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 15 [2023-02-17 03:08:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:09,506 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2023-02-17 03:08:09,506 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-17 03:08:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2023-02-17 03:08:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 03:08:09,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:09,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:08:09,533 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-17 03:08:09,731 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-17 03:08:09,732 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-17 03:08:09,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash 891124571, now seen corresponding path program 1 times [2023-02-17 03:08:09,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:09,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073991833] [2023-02-17 03:08:09,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:09,733 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-17 03:08:09,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:09,736 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-17 03:08:09,737 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-17 03:08:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:09,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:08:09,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:09,810 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-17 03:08:09,826 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-17 03:08:09,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:08:09,837 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-17 03:08:09,848 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-17 03:08:09,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:09,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:09,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073991833] [2023-02-17 03:08:09,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073991833] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:09,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:09,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:08:09,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299554551] [2023-02-17 03:08:09,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:09,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:09,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:09,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-17 03:08:09,852 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-17 03:08:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:09,995 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2023-02-17 03:08:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:08:09,995 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-17 03:08:09,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:09,996 INFO L225 Difference]: With dead ends: 118 [2023-02-17 03:08:09,996 INFO L226 Difference]: Without dead ends: 118 [2023-02-17 03:08:09,996 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-17 03:08:09,996 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-17 03:08:09,997 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-17 03:08:09,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-17 03:08:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2023-02-17 03:08:10,000 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-17 03:08:10,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2023-02-17 03:08:10,001 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 17 [2023-02-17 03:08:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:10,001 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2023-02-17 03:08:10,001 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-17 03:08:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2023-02-17 03:08:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 03:08:10,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:10,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:08:10,021 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-17 03:08:10,202 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-17 03:08:10,202 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-17 03:08:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 891124572, now seen corresponding path program 1 times [2023-02-17 03:08:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:10,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080168537] [2023-02-17 03:08:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:10,203 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-17 03:08:10,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:10,204 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-17 03:08:10,205 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-17 03:08:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:10,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 03:08:10,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:10,293 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-17 03:08:10,312 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-17 03:08:10,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:10,320 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-17 03:08:10,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:08:10,323 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-17 03:08:10,329 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-17 03:08:10,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:10,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:10,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080168537] [2023-02-17 03:08:10,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080168537] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:10,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:10,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 03:08:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772562634] [2023-02-17 03:08:10,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:10,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:08:10,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:10,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:08:10,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2023-02-17 03:08:10,331 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-17 03:08:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:10,560 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2023-02-17 03:08:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:08:10,560 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-17 03:08:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:10,561 INFO L225 Difference]: With dead ends: 148 [2023-02-17 03:08:10,561 INFO L226 Difference]: Without dead ends: 148 [2023-02-17 03:08:10,561 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-17 03:08:10,562 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-17 03:08:10,562 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-17 03:08:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-17 03:08:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 80. [2023-02-17 03:08:10,569 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-17 03:08:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-02-17 03:08:10,570 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 17 [2023-02-17 03:08:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:10,571 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-02-17 03:08:10,571 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-17 03:08:10,571 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-02-17 03:08:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 03:08:10,572 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:10,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:08:10,591 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-17 03:08:10,792 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-17 03:08:10,795 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-17 03:08:10,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2005389781, now seen corresponding path program 1 times [2023-02-17 03:08:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:10,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706512611] [2023-02-17 03:08:10,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:10,796 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-17 03:08:10,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:10,797 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-17 03:08:10,801 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-17 03:08:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:10,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 03:08:10,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:10,907 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a19~0#1.base_6| (_ BitVec 32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_6|) (_ bv0 1)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_6| (_ bv0 1)) |c_#valid|))) is different from true [2023-02-17 03:08:10,911 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-17 03:08:10,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:10,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:10,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706512611] [2023-02-17 03:08:10,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706512611] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:10,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:10,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:08:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679647251] [2023-02-17 03:08:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:08:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:08:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-17 03:08:10,915 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-17 03:08:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:11,026 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2023-02-17 03:08:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:08:11,027 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-17 03:08:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:11,028 INFO L225 Difference]: With dead ends: 111 [2023-02-17 03:08:11,028 INFO L226 Difference]: Without dead ends: 105 [2023-02-17 03:08:11,028 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-17 03:08:11,028 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-17 03:08:11,028 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-17 03:08:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-17 03:08:11,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-02-17 03:08:11,031 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-17 03:08:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2023-02-17 03:08:11,032 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 17 [2023-02-17 03:08:11,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:11,032 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2023-02-17 03:08:11,032 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-17 03:08:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2023-02-17 03:08:11,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 03:08:11,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:11,037 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-17 03:08:11,047 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-17 03:08:11,245 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-17 03:08:11,245 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-17 03:08:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1867537779, now seen corresponding path program 1 times [2023-02-17 03:08:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:11,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513435078] [2023-02-17 03:08:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:11,246 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-17 03:08:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:11,247 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-17 03:08:11,251 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-17 03:08:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:11,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:08:11,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:11,310 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-17 03:08:11,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:11,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:11,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513435078] [2023-02-17 03:08:11,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513435078] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:11,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:11,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:08:11,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754743103] [2023-02-17 03:08:11,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:11,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:08:11,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:11,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:08:11,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:08:11,312 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-17 03:08:11,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:11,327 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2023-02-17 03:08:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:08:11,327 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-17 03:08:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:11,328 INFO L225 Difference]: With dead ends: 166 [2023-02-17 03:08:11,328 INFO L226 Difference]: Without dead ends: 166 [2023-02-17 03:08:11,329 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-17 03:08:11,329 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-17 03:08:11,329 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-17 03:08:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-17 03:08:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 94. [2023-02-17 03:08:11,333 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-17 03:08:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2023-02-17 03:08:11,333 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 23 [2023-02-17 03:08:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:11,334 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2023-02-17 03:08:11,334 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-17 03:08:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2023-02-17 03:08:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 03:08:11,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:11,335 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-17 03:08:11,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 03:08:11,541 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-17 03:08:11,542 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-17 03:08:11,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1867478197, now seen corresponding path program 1 times [2023-02-17 03:08:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:11,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987994776] [2023-02-17 03:08:11,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:11,543 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-17 03:08:11,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:11,545 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-17 03:08:11,546 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-17 03:08:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:11,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:08:11,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:11,620 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-17 03:08:11,628 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-17 03:08:11,632 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-17 03:08:11,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:11,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:11,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987994776] [2023-02-17 03:08:11,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987994776] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:11,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:11,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:08:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382829592] [2023-02-17 03:08:11,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:11,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:11,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:11,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:11,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:08:11,635 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-17 03:08:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:11,689 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2023-02-17 03:08:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:08:11,691 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-17 03:08:11,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:11,692 INFO L225 Difference]: With dead ends: 117 [2023-02-17 03:08:11,692 INFO L226 Difference]: Without dead ends: 117 [2023-02-17 03:08:11,692 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-17 03:08:11,692 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-17 03:08:11,693 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-17 03:08:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-17 03:08:11,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 92. [2023-02-17 03:08:11,710 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-17 03:08:11,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-02-17 03:08:11,710 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 23 [2023-02-17 03:08:11,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:11,711 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-02-17 03:08:11,711 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-17 03:08:11,711 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-02-17 03:08:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 03:08:11,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:11,712 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-17 03:08:11,719 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-17 03:08:11,918 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-17 03:08:11,919 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-17 03:08:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash 440766702, now seen corresponding path program 1 times [2023-02-17 03:08:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:11,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841554232] [2023-02-17 03:08:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:11,920 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-17 03:08:11,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:11,921 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-17 03:08:11,923 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-17 03:08:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:11,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 03:08:11,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:12,002 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-17 03:08:12,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:12,048 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-17 03:08:12,057 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-17 03:08:12,062 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-17 03:08:12,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:14,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:14,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841554232] [2023-02-17 03:08:14,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841554232] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:14,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [395478594] [2023-02-17 03:08:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:14,098 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:08:14,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:08:14,102 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-17 03:08:14,103 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-17 03:08:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:14,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:08:14,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:14,229 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-17 03:08:14,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:14,258 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-17 03:08:14,263 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-17 03:08:14,263 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-17 03:08:14,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:16,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [395478594] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:16,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:08:16,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-17 03:08:16,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35060858] [2023-02-17 03:08:16,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:08:16,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:08:16,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:16,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:08:16,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2023-02-17 03:08:16,289 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-17 03:08:16,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:16,390 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2023-02-17 03:08:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:08:16,391 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-17 03:08:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:16,392 INFO L225 Difference]: With dead ends: 91 [2023-02-17 03:08:16,392 INFO L226 Difference]: Without dead ends: 91 [2023-02-17 03:08:16,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=64, Invalid=175, Unknown=1, NotChecked=0, Total=240 [2023-02-17 03:08:16,393 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-17 03:08:16,393 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-17 03:08:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-17 03:08:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-17 03:08:16,395 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-17 03:08:16,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2023-02-17 03:08:16,396 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 24 [2023-02-17 03:08:16,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:16,396 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2023-02-17 03:08:16,396 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-17 03:08:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2023-02-17 03:08:16,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 03:08:16,397 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:16,397 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-17 03:08:16,410 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-17 03:08:16,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2023-02-17 03:08:16,806 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-17 03:08:16,806 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-17 03:08:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash 778865962, now seen corresponding path program 1 times [2023-02-17 03:08:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:16,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028696629] [2023-02-17 03:08:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:16,807 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-17 03:08:16,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:16,808 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-17 03:08:16,810 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-17 03:08:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:16,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:08:16,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:16,902 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-17 03:08:16,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:16,968 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 31 treesize of output 24 [2023-02-17 03:08:16,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-02-17 03:08:16,992 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-17 03:08:16,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:17,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:17,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028696629] [2023-02-17 03:08:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028696629] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:17,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [742991601] [2023-02-17 03:08:17,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:17,081 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:08:17,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:08:17,084 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-17 03:08:17,104 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-17 03:08:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:17,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:08:17,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:17,233 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-17 03:08:19,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:19,368 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-17 03:08:19,378 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-17 03:08:19,378 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-17 03:08:19,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:19,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [742991601] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:19,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:08:19,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-02-17 03:08:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775707554] [2023-02-17 03:08:19,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:08:19,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 03:08:19,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 03:08:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=256, Unknown=1, NotChecked=0, Total=342 [2023-02-17 03:08:19,452 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 17 states, 14 states have (on average 3.0) internal successors, (42), 15 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-17 03:08:21,477 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-17 03:08:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:21,916 INFO L93 Difference]: Finished difference Result 149 states and 167 transitions. [2023-02-17 03:08:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-17 03:08:21,917 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 3.0) internal successors, (42), 15 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-17 03:08:21,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:21,917 INFO L225 Difference]: With dead ends: 149 [2023-02-17 03:08:21,917 INFO L226 Difference]: Without dead ends: 149 [2023-02-17 03:08:21,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=169, Invalid=532, Unknown=1, NotChecked=0, Total=702 [2023-02-17 03:08:21,918 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 224 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:21,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 324 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 258 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2023-02-17 03:08:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-17 03:08:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 100. [2023-02-17 03:08:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.337837837837838) internal successors, (99), 87 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-17 03:08:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-02-17 03:08:21,923 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 25 [2023-02-17 03:08:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:21,924 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-02-17 03:08:21,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 3.0) internal successors, (42), 15 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-17 03:08:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-02-17 03:08:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 03:08:21,924 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:21,924 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-17 03:08:21,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-02-17 03:08:22,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 (13)] Forceful destruction successful, exit code 0 [2023-02-17 03:08:22,325 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-17 03:08:22,325 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-17 03:08:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1765484354, now seen corresponding path program 1 times [2023-02-17 03:08:22,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:22,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061671219] [2023-02-17 03:08:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:22,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-17 03:08:22,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:22,328 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-17 03:08:22,330 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-17 03:08:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:22,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 03:08:22,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:22,432 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-17 03:08:22,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:22,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:22,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061671219] [2023-02-17 03:08:22,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061671219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:22,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:22,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:08:22,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901752218] [2023-02-17 03:08:22,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:22,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:22,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:08:22,434 INFO L87 Difference]: Start difference. First operand 100 states and 114 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-17 03:08:22,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:22,552 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2023-02-17 03:08:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:08:22,553 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-17 03:08:22,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:22,554 INFO L225 Difference]: With dead ends: 121 [2023-02-17 03:08:22,554 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 03:08:22,554 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-17 03:08:22,555 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-17 03:08:22,555 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-17 03:08:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 03:08:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2023-02-17 03:08:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 88 states have internal predecessors, (102), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-17 03:08:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-02-17 03:08:22,559 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 27 [2023-02-17 03:08:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:22,559 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-02-17 03:08:22,559 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-17 03:08:22,559 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-02-17 03:08:22,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 03:08:22,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:22,560 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-17 03:08:22,568 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-17 03:08:22,760 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-17 03:08:22,760 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-17 03:08:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1765484353, now seen corresponding path program 1 times [2023-02-17 03:08:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:22,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833476560] [2023-02-17 03:08:22,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:22,762 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-17 03:08:22,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:22,763 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-17 03:08:22,765 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-17 03:08:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:22,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:08:22,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:22,859 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-17 03:08:22,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:22,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:22,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833476560] [2023-02-17 03:08:22,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833476560] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:22,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:22,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:08:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592239630] [2023-02-17 03:08:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:22,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:08:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:08:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:08:22,861 INFO L87 Difference]: Start difference. First operand 102 states and 117 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-17 03:08:22,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:22,996 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2023-02-17 03:08:22,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:08:22,997 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-17 03:08:22,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:22,998 INFO L225 Difference]: With dead ends: 110 [2023-02-17 03:08:22,998 INFO L226 Difference]: Without dead ends: 110 [2023-02-17 03:08:22,998 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-17 03:08:22,998 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-17 03:08:22,999 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-17 03:08:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-17 03:08:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2023-02-17 03:08:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.35) internal successors, (108), 93 states have internal predecessors, (108), 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-17 03:08:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 123 transitions. [2023-02-17 03:08:23,002 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 123 transitions. Word has length 27 [2023-02-17 03:08:23,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:23,002 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 123 transitions. [2023-02-17 03:08:23,003 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-17 03:08:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2023-02-17 03:08:23,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 03:08:23,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:23,003 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-17 03:08:23,017 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-17 03:08:23,211 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-17 03:08:23,211 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-17 03:08:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1624958864, now seen corresponding path program 1 times [2023-02-17 03:08:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:23,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927073987] [2023-02-17 03:08:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:23,212 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-17 03:08:23,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:23,214 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-17 03:08:23,216 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-17 03:08:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:23,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:08:23,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:23,312 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-17 03:08:23,322 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-17 03:08:23,341 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-17 03:08:23,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:23,353 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-17 03:08:23,358 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-17 03:08:23,366 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-17 03:08:23,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:25,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:25,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927073987] [2023-02-17 03:08:25,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927073987] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:25,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [879157700] [2023-02-17 03:08:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:25,434 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:08:25,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:08:25,444 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-17 03:08:25,453 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-17 03:08:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:25,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:08:25,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:25,584 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-17 03:08:25,591 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-17 03:08:25,599 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-17 03:08:25,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:25,608 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-17 03:08:25,613 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-17 03:08:25,614 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-17 03:08:25,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:27,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [879157700] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:27,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:08:27,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-17 03:08:27,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867532220] [2023-02-17 03:08:27,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:08:27,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:08:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:27,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:08:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2023-02-17 03:08:27,679 INFO L87 Difference]: Start difference. First operand 107 states and 123 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-17 03:08:28,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:28,031 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2023-02-17 03:08:28,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:08:28,032 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-17 03:08:28,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:28,033 INFO L225 Difference]: With dead ends: 124 [2023-02-17 03:08:28,033 INFO L226 Difference]: Without dead ends: 124 [2023-02-17 03:08:28,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=40, Invalid=115, Unknown=1, NotChecked=0, Total=156 [2023-02-17 03:08:28,034 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 93 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:28,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 307 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:08:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-17 03:08:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2023-02-17 03:08:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 97 states have internal predecessors, (112), 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-17 03:08:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2023-02-17 03:08:28,036 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 26 [2023-02-17 03:08:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:28,037 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2023-02-17 03:08:28,037 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-17 03:08:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2023-02-17 03:08:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 03:08:28,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:28,037 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-17 03:08:28,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-17 03:08:28,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2023-02-17 03:08:28,455 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-17 03:08:28,456 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-17 03:08:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash 631952143, now seen corresponding path program 1 times [2023-02-17 03:08:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:28,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594422703] [2023-02-17 03:08:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:28,469 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-17 03:08:28,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:28,470 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-17 03:08:28,473 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-17 03:08:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:28,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:08:28,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:28,554 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-17 03:08:28,559 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-17 03:08:28,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-17 03:08:28,578 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-17 03:08:28,589 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-17 03:08:28,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:28,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:28,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594422703] [2023-02-17 03:08:28,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594422703] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:28,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:28,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:08:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581881036] [2023-02-17 03:08:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:28,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:28,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:28,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:28,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:08:28,591 INFO L87 Difference]: Start difference. First operand 111 states and 127 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-17 03:08:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:28,666 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2023-02-17 03:08:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:08:28,667 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-17 03:08:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:28,667 INFO L225 Difference]: With dead ends: 93 [2023-02-17 03:08:28,667 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 03:08:28,667 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-17 03:08:28,668 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:28,668 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.1s Time] [2023-02-17 03:08:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 03:08:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-17 03:08:28,670 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-17 03:08:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-02-17 03:08:28,670 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 26 [2023-02-17 03:08:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:28,670 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-02-17 03:08:28,670 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-17 03:08:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-02-17 03:08:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 03:08:28,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:28,671 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-17 03:08:28,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-02-17 03:08:28,871 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-17 03:08:28,871 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-17 03:08:28,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:28,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1765464909, now seen corresponding path program 1 times [2023-02-17 03:08:28,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:28,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159085195] [2023-02-17 03:08:28,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:28,872 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-17 03:08:28,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:28,873 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-17 03:08:28,877 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-17 03:08:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:28,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 03:08:28,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:28,992 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-17 03:08:28,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:28,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:28,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159085195] [2023-02-17 03:08:28,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159085195] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:28,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:28,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:08:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024519912] [2023-02-17 03:08:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:28,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:28,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:28,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:08:28,995 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-17 03:08:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:29,157 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2023-02-17 03:08:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:08:29,158 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-17 03:08:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:29,158 INFO L225 Difference]: With dead ends: 98 [2023-02-17 03:08:29,158 INFO L226 Difference]: Without dead ends: 98 [2023-02-17 03:08:29,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:08:29,159 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-17 03:08:29,159 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-17 03:08:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-17 03:08:29,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2023-02-17 03:08:29,161 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-17 03:08:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2023-02-17 03:08:29,162 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 27 [2023-02-17 03:08:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:29,162 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2023-02-17 03:08:29,162 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-17 03:08:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2023-02-17 03:08:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 03:08:29,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:29,163 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-17 03:08:29,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-17 03:08:29,363 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-17 03:08:29,363 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-17 03:08:29,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1765464908, now seen corresponding path program 1 times [2023-02-17 03:08:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:29,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254169911] [2023-02-17 03:08:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:29,364 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-17 03:08:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:29,365 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-17 03:08:29,411 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-17 03:08:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:29,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:08:29,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:29,534 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_323 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_323))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 03:08:29,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:29,545 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-17 03:08:29,548 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:08:29,549 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-17 03:08:29,579 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-17 03:08:29,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:29,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:29,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254169911] [2023-02-17 03:08:29,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254169911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:29,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:29,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 03:08:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910514595] [2023-02-17 03:08:29,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:29,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:08:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:08:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-17 03:08:29,580 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-17 03:08:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:29,956 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2023-02-17 03:08:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:08:29,956 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-17 03:08:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:29,957 INFO L225 Difference]: With dead ends: 123 [2023-02-17 03:08:29,957 INFO L226 Difference]: Without dead ends: 123 [2023-02-17 03:08:29,957 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-17 03:08:29,957 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 120 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:29,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 190 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 198 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2023-02-17 03:08:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-17 03:08:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2023-02-17 03:08:29,960 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-17 03:08:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-02-17 03:08:29,960 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 27 [2023-02-17 03:08:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:29,960 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-02-17 03:08:29,960 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-17 03:08:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-02-17 03:08:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 03:08:29,961 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:29,961 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-17 03:08:29,968 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-17 03:08:30,161 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-17 03:08:30,162 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-17 03:08:30,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1104559937, now seen corresponding path program 1 times [2023-02-17 03:08:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:30,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91886030] [2023-02-17 03:08:30,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:30,162 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-17 03:08:30,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:30,177 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-17 03:08:30,193 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-17 03:08:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:30,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 03:08:30,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:30,274 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-17 03:08:30,303 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-17 03:08:30,314 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-17 03:08:30,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:30,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91886030] [2023-02-17 03:08:30,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91886030] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:30,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:30,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 03:08:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802858801] [2023-02-17 03:08:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:30,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:08:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:30,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:08:30,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:08:30,315 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-17 03:08:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:30,519 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-17 03:08:30,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:08:30,520 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-17 03:08:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:30,520 INFO L225 Difference]: With dead ends: 91 [2023-02-17 03:08:30,520 INFO L226 Difference]: Without dead ends: 91 [2023-02-17 03:08:30,520 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-17 03:08:30,521 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 82 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:30,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 320 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:08:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-17 03:08:30,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2023-02-17 03:08:30,523 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-17 03:08:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2023-02-17 03:08:30,523 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2023-02-17 03:08:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:30,523 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2023-02-17 03:08:30,523 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-17 03:08:30,523 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2023-02-17 03:08:30,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-17 03:08:30,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:30,524 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-17 03:08:30,543 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-17 03:08:30,732 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-17 03:08:30,733 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-17 03:08:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1105162709, now seen corresponding path program 1 times [2023-02-17 03:08:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:30,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250496410] [2023-02-17 03:08:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:30,734 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-17 03:08:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:30,735 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-17 03:08:30,737 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-17 03:08:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:30,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:08:30,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:30,831 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-17 03:08:30,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:30,922 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-17 03:08:30,961 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-17 03:08:30,975 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-17 03:08:30,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:33,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:33,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250496410] [2023-02-17 03:08:33,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250496410] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:33,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1217002523] [2023-02-17 03:08:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:33,063 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:08:33,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:08:33,065 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-17 03:08:33,066 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-17 03:08:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:33,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:08:33,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:33,202 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-17 03:08:33,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:33,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-17 03:08:33,288 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-17 03:08:33,288 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-17 03:08:33,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:35,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1217002523] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:35,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:08:35,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-17 03:08:35,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636492609] [2023-02-17 03:08:35,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:08:35,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:08:35,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:35,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:08:35,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2023-02-17 03:08:35,353 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-17 03:08:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:35,790 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2023-02-17 03:08:35,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:08:35,791 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-17 03:08:35,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:35,792 INFO L225 Difference]: With dead ends: 92 [2023-02-17 03:08:35,792 INFO L226 Difference]: Without dead ends: 92 [2023-02-17 03:08:35,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=102, Invalid=317, Unknown=1, NotChecked=0, Total=420 [2023-02-17 03:08:35,792 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 91 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:35,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 279 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:08:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-17 03:08:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2023-02-17 03:08:35,794 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-17 03:08:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2023-02-17 03:08:35,794 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 28 [2023-02-17 03:08:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:35,795 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2023-02-17 03:08:35,795 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-17 03:08:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2023-02-17 03:08:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 03:08:35,795 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:35,795 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-17 03:08:35,798 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-17 03:08:36,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-17 03:08:36,198 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-17 03:08:36,198 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-17 03:08:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash -118380194, now seen corresponding path program 1 times [2023-02-17 03:08:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:36,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730602263] [2023-02-17 03:08:36,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:36,199 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-17 03:08:36,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:36,201 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-17 03:08:36,203 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-17 03:08:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:36,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:08:36,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:36,368 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-17 03:08:36,474 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-17 03:08:36,509 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-17 03:08:36,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:36,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:36,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730602263] [2023-02-17 03:08:36,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730602263] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:36,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:36,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 03:08:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607067724] [2023-02-17 03:08:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:36,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:08:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:08:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:08:36,510 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-17 03:08:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:37,501 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-02-17 03:08:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 03:08:37,502 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-17 03:08:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:37,503 INFO L225 Difference]: With dead ends: 89 [2023-02-17 03:08:37,503 INFO L226 Difference]: Without dead ends: 89 [2023-02-17 03:08:37,503 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-17 03:08:37,503 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 116 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:37,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 230 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-17 03:08:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-17 03:08:37,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-02-17 03:08:37,506 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-17 03:08:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2023-02-17 03:08:37,508 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 29 [2023-02-17 03:08:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:37,508 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2023-02-17 03:08:37,508 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-17 03:08:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2023-02-17 03:08:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 03:08:37,509 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:37,509 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-17 03:08:37,516 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 (25)] Ended with exit code 0 [2023-02-17 03:08:37,711 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-17 03:08:37,712 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-17 03:08:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:37,712 INFO L85 PathProgramCache]: Analyzing trace with hash -99262379, now seen corresponding path program 1 times [2023-02-17 03:08:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954649520] [2023-02-17 03:08:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:37,713 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-17 03:08:37,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:37,717 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-17 03:08:37,718 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-17 03:08:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:37,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:08:37,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:37,795 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-17 03:08:37,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:37,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:37,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954649520] [2023-02-17 03:08:37,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954649520] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:37,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:37,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:08:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637503913] [2023-02-17 03:08:37,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:37,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:08:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:37,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:08:37,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:08:37,797 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-17 03:08:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:37,823 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2023-02-17 03:08:37,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:08:37,824 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-17 03:08:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:37,831 INFO L225 Difference]: With dead ends: 103 [2023-02-17 03:08:37,831 INFO L226 Difference]: Without dead ends: 103 [2023-02-17 03:08:37,832 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-17 03:08:37,833 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-17 03:08:37,833 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-17 03:08:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-17 03:08:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2023-02-17 03:08:37,844 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-17 03:08:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-17 03:08:37,845 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2023-02-17 03:08:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:37,846 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-17 03:08:37,846 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-17 03:08:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-17 03:08:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 03:08:37,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:37,846 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-17 03:08:37,856 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-17 03:08:38,047 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-17 03:08:38,047 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-17 03:08:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash -99694285, now seen corresponding path program 1 times [2023-02-17 03:08:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:38,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939255111] [2023-02-17 03:08:38,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:38,048 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-17 03:08:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:38,049 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-17 03:08:38,052 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-17 03:08:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:38,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:08:38,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:38,160 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-17 03:08:38,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:38,265 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-17 03:08:38,315 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-17 03:08:38,342 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-17 03:08:38,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:40,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:40,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939255111] [2023-02-17 03:08:40,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939255111] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:40,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [404000594] [2023-02-17 03:08:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:40,531 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:08:40,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:08:40,532 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-17 03:08:40,533 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-17 03:08:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:40,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:08:40,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:40,680 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-17 03:08:40,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:40,743 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-17 03:08:40,748 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-17 03:08:40,749 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-17 03:08:40,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:42,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [404000594] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:42,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:08:42,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-17 03:08:42,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394524343] [2023-02-17 03:08:42,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:08:42,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:08:42,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:42,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:08:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2023-02-17 03:08:42,849 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-17 03:08:44,862 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-17 03:08:46,883 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-17 03:08:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:47,305 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-02-17 03:08:47,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 03:08:47,306 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-17 03:08:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:47,307 INFO L225 Difference]: With dead ends: 91 [2023-02-17 03:08:47,307 INFO L226 Difference]: Without dead ends: 91 [2023-02-17 03:08:47,307 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-17 03:08:47,307 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:47,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 230 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2023-02-17 03:08:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-17 03:08:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-02-17 03:08:47,309 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-17 03:08:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2023-02-17 03:08:47,309 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 29 [2023-02-17 03:08:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:47,310 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2023-02-17 03:08:47,310 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-17 03:08:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2023-02-17 03:08:47,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 03:08:47,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:47,310 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-17 03:08:47,319 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-17 03:08:47,516 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-17 03:08:47,716 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-17 03:08:47,716 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-17 03:08:47,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 625181411, now seen corresponding path program 1 times [2023-02-17 03:08:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:47,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168091342] [2023-02-17 03:08:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:47,717 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-17 03:08:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:47,718 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-17 03:08:47,719 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-17 03:08:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:47,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:08:47,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:47,799 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-17 03:08:47,824 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-17 03:08:47,858 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-17 03:08:47,870 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-17 03:08:47,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:47,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:47,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168091342] [2023-02-17 03:08:47,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168091342] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:47,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:47,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 03:08:47,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647511283] [2023-02-17 03:08:47,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:47,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:08:47,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:08:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:08:47,872 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-17 03:08:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:48,216 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-02-17 03:08:48,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:08:48,217 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-17 03:08:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:48,217 INFO L225 Difference]: With dead ends: 99 [2023-02-17 03:08:48,217 INFO L226 Difference]: Without dead ends: 99 [2023-02-17 03:08:48,217 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-17 03:08:48,218 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 62 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:08:48,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 264 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:08:48,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-17 03:08:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2023-02-17 03:08:48,220 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-17 03:08:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-17 03:08:48,221 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 30 [2023-02-17 03:08:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:48,222 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-17 03:08:48,222 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-17 03:08:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-17 03:08:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 03:08:48,223 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:48,223 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-17 03:08:48,241 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-17 03:08:48,430 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-17 03:08:48,431 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-17 03:08:48,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1978491108, now seen corresponding path program 1 times [2023-02-17 03:08:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:48,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896580819] [2023-02-17 03:08:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:48,432 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-17 03:08:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:48,433 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-17 03:08:48,435 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-17 03:08:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:48,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:08:48,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:48,507 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-17 03:08:48,511 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-17 03:08:48,536 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-17 03:08:48,541 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-17 03:08:48,560 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-17 03:08:48,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:48,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:48,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896580819] [2023-02-17 03:08:48,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896580819] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:48,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:48,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:08:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041036802] [2023-02-17 03:08:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:48,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:08:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:08:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:08:48,562 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-17 03:08:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:48,648 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-17 03:08:48,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:08:48,649 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-17 03:08:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:48,649 INFO L225 Difference]: With dead ends: 113 [2023-02-17 03:08:48,649 INFO L226 Difference]: Without dead ends: 113 [2023-02-17 03:08:48,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:08:48,650 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-17 03:08:48,650 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-17 03:08:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-17 03:08:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2023-02-17 03:08:48,652 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-17 03:08:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-17 03:08:48,652 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 30 [2023-02-17 03:08:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:48,652 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-17 03:08:48,653 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-17 03:08:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-17 03:08:48,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 03:08:48,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:48,653 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-17 03:08:48,673 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-17 03:08:48,853 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-17 03:08:48,853 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-17 03:08:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1615411610, now seen corresponding path program 1 times [2023-02-17 03:08:48,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:48,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679027457] [2023-02-17 03:08:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:48,854 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-17 03:08:48,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:48,856 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-17 03:08:48,858 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-17 03:08:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:48,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:08:48,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:48,943 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-17 03:08:48,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:08:48,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:48,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679027457] [2023-02-17 03:08:48,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679027457] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:08:48,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:08:48,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:08:48,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564505553] [2023-02-17 03:08:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:08:48,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:08:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:08:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:08:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:08:48,946 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-17 03:08:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:08:48,978 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2023-02-17 03:08:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:08:48,979 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-17 03:08:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:08:48,979 INFO L225 Difference]: With dead ends: 96 [2023-02-17 03:08:48,979 INFO L226 Difference]: Without dead ends: 96 [2023-02-17 03:08:48,979 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-17 03:08:48,980 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-17 03:08:48,980 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-17 03:08:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-17 03:08:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2023-02-17 03:08:48,981 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-17 03:08:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-02-17 03:08:48,981 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 30 [2023-02-17 03:08:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:08:48,982 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-02-17 03:08:48,982 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-17 03:08:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-02-17 03:08:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 03:08:48,982 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:08:48,982 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-17 03:08:48,989 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-17 03:08:49,182 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-17 03:08:49,183 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-17 03:08:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:08:49,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1204444567, now seen corresponding path program 1 times [2023-02-17 03:08:49,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:08:49,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833670118] [2023-02-17 03:08:49,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:49,183 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-17 03:08:49,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:08:49,184 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-17 03:08:49,187 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-17 03:08:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:49,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 03:08:49,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:49,278 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-17 03:08:49,311 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-17 03:08:49,365 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-17 03:08:49,385 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_549 (_ BitVec 1))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_549) |c_#valid|)))) is different from true [2023-02-17 03:08:49,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:08:49,392 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-17 03:08:49,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:49,401 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-17 03:08:49,440 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-17 03:08:49,459 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-17 03:08:49,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:08:55,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:08:55,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833670118] [2023-02-17 03:08:55,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833670118] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:08:55,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1259744156] [2023-02-17 03:08:55,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:08:55,719 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:08:55,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:08:55,720 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-17 03:08:55,721 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-17 03:08:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:08:55,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 03:08:55,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:08:55,873 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-17 03:08:55,882 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-17 03:08:55,888 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-17 03:08:55,893 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2023-02-17 03:08:55,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:08:55,920 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-17 03:08:55,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:08:55,948 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-17 03:08:55,957 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-17 03:08:55,958 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-17 03:08:55,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:09:08,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1259744156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:09:08,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:09:08,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2023-02-17 03:09:08,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343425014] [2023-02-17 03:09:08,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:09:08,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:09:08,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:09:08,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:09:08,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=193, Unknown=9, NotChecked=58, Total=306 [2023-02-17 03:09:08,187 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-17 03:09:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:09:08,575 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2023-02-17 03:09:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:09:08,576 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-17 03:09:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:09:08,577 INFO L225 Difference]: With dead ends: 84 [2023-02-17 03:09:08,577 INFO L226 Difference]: Without dead ends: 84 [2023-02-17 03:09:08,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=94, Invalid=324, Unknown=10, NotChecked=78, Total=506 [2023-02-17 03:09:08,577 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:09:08,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 230 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 201 Invalid, 0 Unknown, 122 Unchecked, 0.3s Time] [2023-02-17 03:09:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-17 03:09:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-17 03:09:08,579 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-17 03:09:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2023-02-17 03:09:08,579 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 30 [2023-02-17 03:09:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:09:08,579 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2023-02-17 03:09:08,579 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-17 03:09:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2023-02-17 03:09:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-17 03:09:08,580 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:09:08,580 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-17 03:09:08,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-02-17 03:09:08,787 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-17 03:09:08,980 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-17 03:09:08,980 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-17 03:09:08,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:09:08,981 INFO L85 PathProgramCache]: Analyzing trace with hash -584147051, now seen corresponding path program 1 times [2023-02-17 03:09:08,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:09:08,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891880187] [2023-02-17 03:09:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:08,981 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-17 03:09:08,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:09:08,983 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-17 03:09:08,985 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-17 03:09:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:09,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:09:09,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:09,075 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-17 03:09:09,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:09:09,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:09:09,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891880187] [2023-02-17 03:09:09,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891880187] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:09:09,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:09:09,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:09:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152044831] [2023-02-17 03:09:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:09:09,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:09:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:09:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:09:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:09:09,077 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-17 03:09:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:09:09,111 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2023-02-17 03:09:09,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:09:09,112 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-17 03:09:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:09:09,112 INFO L225 Difference]: With dead ends: 91 [2023-02-17 03:09:09,112 INFO L226 Difference]: Without dead ends: 91 [2023-02-17 03:09:09,113 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-17 03:09:09,113 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-17 03:09:09,113 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-17 03:09:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-17 03:09:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-02-17 03:09:09,115 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-17 03:09:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2023-02-17 03:09:09,115 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 30 [2023-02-17 03:09:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:09:09,115 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2023-02-17 03:09:09,115 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-17 03:09:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2023-02-17 03:09:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 03:09:09,115 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:09:09,115 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-17 03:09:09,128 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-17 03:09:09,324 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-17 03:09:09,324 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-17 03:09:09,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:09:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1451440213, now seen corresponding path program 1 times [2023-02-17 03:09:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:09:09,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418200374] [2023-02-17 03:09:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:09,325 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-17 03:09:09,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:09:09,326 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-17 03:09:09,328 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-17 03:09:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:09,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 03:09:09,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:09,417 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-17 03:09:09,433 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:09,433 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-17 03:09:09,447 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-17 03:09:11,502 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_21| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_21|) (bvadd (_ bv4 32) (_ bv0 32))) |v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_21|))) is different from true [2023-02-17 03:09:11,507 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-17 03:09:11,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:11,534 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-17 03:09:11,578 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-17 03:09:11,599 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-17 03:09:11,654 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-17 03:09:11,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:09:11,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:11,813 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-17 03:09:11,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:09:11,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418200374] [2023-02-17 03:09:11,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418200374] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:09:11,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1355800436] [2023-02-17 03:09:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:11,931 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:09:11,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:09:11,932 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-17 03:09:11,950 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-17 03:09:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:12,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 03:09:12,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:12,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:12,379 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-17 03:09:12,525 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-17 03:09:12,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:09:12,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1355800436] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:09:12,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:09:12,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2023-02-17 03:09:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830709824] [2023-02-17 03:09:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:09:12,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:09:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:09:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:09:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=633, Unknown=1, NotChecked=50, Total=756 [2023-02-17 03:09:12,527 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-17 03:09:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:09:13,237 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2023-02-17 03:09:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:09:13,238 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-17 03:09:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:09:13,239 INFO L225 Difference]: With dead ends: 97 [2023-02-17 03:09:13,239 INFO L226 Difference]: Without dead ends: 97 [2023-02-17 03:09:13,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=139, Invalid=1054, Unknown=1, NotChecked=66, Total=1260 [2023-02-17 03:09:13,240 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 122 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:09:13,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 200 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 03:09:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-17 03:09:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2023-02-17 03:09:13,241 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-17 03:09:13,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-02-17 03:09:13,242 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 33 [2023-02-17 03:09:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:09:13,242 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-02-17 03:09:13,242 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-17 03:09:13,242 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-02-17 03:09:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 03:09:13,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:09:13,242 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-17 03:09:13,250 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-17 03:09:13,451 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-17 03:09:13,651 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-17 03:09:13,651 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-17 03:09:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:09:13,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1451440214, now seen corresponding path program 1 times [2023-02-17 03:09:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:09:13,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120325417] [2023-02-17 03:09:13,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:13,652 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-17 03:09:13,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:09:13,654 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-17 03:09:13,656 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-17 03:09:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:13,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 03:09:13,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:13,810 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-17 03:09:13,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:09:13,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:09:13,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120325417] [2023-02-17 03:09:13,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120325417] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:09:13,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:09:13,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 03:09:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84467708] [2023-02-17 03:09:13,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:09:13,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:09:13,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:09:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:09:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:09:13,812 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-17 03:09:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:09:14,051 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2023-02-17 03:09:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 03:09:14,052 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-17 03:09:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:09:14,052 INFO L225 Difference]: With dead ends: 93 [2023-02-17 03:09:14,052 INFO L226 Difference]: Without dead ends: 93 [2023-02-17 03:09:14,052 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-17 03:09:14,053 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-17 03:09:14,053 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-17 03:09:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-17 03:09:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-02-17 03:09:14,055 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-17 03:09:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2023-02-17 03:09:14,055 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 33 [2023-02-17 03:09:14,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:09:14,055 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2023-02-17 03:09:14,055 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-17 03:09:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2023-02-17 03:09:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 03:09:14,055 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:09:14,055 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-17 03:09:14,068 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 (37)] Ended with exit code 0 [2023-02-17 03:09:14,256 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-17 03:09:14,256 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-17 03:09:14,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:09:14,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1801348875, now seen corresponding path program 1 times [2023-02-17 03:09:14,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:09:14,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043756149] [2023-02-17 03:09:14,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:14,257 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-17 03:09:14,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:09:14,258 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-17 03:09:14,260 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-17 03:09:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:14,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:09:14,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:14,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:14,401 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-17 03:09:14,416 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-17 03:09:14,437 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-17 03:09:16,496 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_687 (_ 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_687))) (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 (= |v_ULTIMATE.start_probe_19_~a#1.base_BEFORE_CALL_31| (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|))))) is different from true [2023-02-17 03:09:16,503 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:16,504 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-17 03:09:16,509 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-17 03:09:16,512 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-17 03:09:16,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:09:16,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:09:16,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043756149] [2023-02-17 03:09:16,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043756149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:09:16,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:09:16,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 03:09:16,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436437104] [2023-02-17 03:09:16,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:09:16,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 03:09:16,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:09:16,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 03:09:16,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=82, Unknown=2, NotChecked=18, Total=132 [2023-02-17 03:09:16,513 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-17 03:09:18,534 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-17 03:09:20,543 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-17 03:09:22,600 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-17 03:09:24,613 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-17 03:09:26,786 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-17 03:09:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:09:26,841 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2023-02-17 03:09:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 03:09:26,841 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-17 03:09:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:09:26,842 INFO L225 Difference]: With dead ends: 88 [2023-02-17 03:09:26,842 INFO L226 Difference]: Without dead ends: 88 [2023-02-17 03:09:26,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=48, Invalid=136, Unknown=2, NotChecked=24, Total=210 [2023-02-17 03:09:26,842 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:09:26,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 165 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 5 Unknown, 74 Unchecked, 10.3s Time] [2023-02-17 03:09:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-17 03:09:26,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-17 03:09:26,844 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-17 03:09:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2023-02-17 03:09:26,845 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 33 [2023-02-17 03:09:26,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:09:26,845 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2023-02-17 03:09:26,845 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-17 03:09:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2023-02-17 03:09:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 03:09:26,845 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:09:26,845 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-17 03:09:26,853 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-17 03:09:27,045 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-17 03:09:27,046 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-17 03:09:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:09:27,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1801348876, now seen corresponding path program 1 times [2023-02-17 03:09:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:09:27,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286985976] [2023-02-17 03:09:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:27,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:09:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:09:27,048 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-17 03:09:27,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 (39)] Waiting until timeout for monitored process [2023-02-17 03:09:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:27,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 03:09:27,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:27,163 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_707 (_ BitVec 32))) (= (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_707) |c_#length|)))) is different from true [2023-02-17 03:09:27,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:27,171 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-17 03:09:27,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:27,174 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-17 03:09:27,203 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-17 03:09:27,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:09:27,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:09:27,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286985976] [2023-02-17 03:09:27,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286985976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:09:27,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:09:27,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-17 03:09:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520180492] [2023-02-17 03:09:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:09:27,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:09:27,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:09:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:09:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=27, Unknown=1, NotChecked=10, Total=56 [2023-02-17 03:09:27,205 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-17 03:09:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:09:27,390 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-02-17 03:09:27,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:09:27,390 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-17 03:09:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:09:27,391 INFO L225 Difference]: With dead ends: 87 [2023-02-17 03:09:27,391 INFO L226 Difference]: Without dead ends: 87 [2023-02-17 03:09:27,391 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-17 03:09:27,391 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:09:27,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 90 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2023-02-17 03:09:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-17 03:09:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-17 03:09:27,393 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-17 03:09:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2023-02-17 03:09:27,393 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 33 [2023-02-17 03:09:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:09:27,393 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2023-02-17 03:09:27,394 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-17 03:09:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2023-02-17 03:09:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-17 03:09:27,394 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:09:27,394 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-17 03:09:27,403 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-17 03:09:27,602 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-17 03:09:27,602 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-17 03:09:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:09:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1275833015, now seen corresponding path program 1 times [2023-02-17 03:09:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:09:27,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60928860] [2023-02-17 03:09:27,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:27,603 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-17 03:09:27,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:09:27,604 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-17 03:09:27,606 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-17 03:09:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:27,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-17 03:09:27,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:27,759 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-17 03:09:27,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:27,825 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-17 03:09:27,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:27,836 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-17 03:09:27,845 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-17 03:09:37,935 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_726 (_ BitVec 1))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| v_ArrVal_726))) (and (= (select .cse0 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_14|) (_ bv0 1)) (= (_ 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)))))) is different from true [2023-02-17 03:09:37,936 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-17 03:09:37,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:09:42,081 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (_ 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_730)) |c_ULTIMATE.start_probe_19_~a#1.base|) (bvadd |c_ULTIMATE.start_probe_19_~a#1.offset| (_ bv4 32))) (_ 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-17 03:09:42,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:09:42,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60928860] [2023-02-17 03:09:42,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60928860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:09:42,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1808126579] [2023-02-17 03:09:42,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:09:42,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:09:42,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:09:42,087 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-17 03:09:42,087 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-17 03:09:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:09:42,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 03:09:42,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:09:42,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:42,320 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-17 03:09:42,456 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-17 03:09:42,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:42,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:42,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:42,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:42,626 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-17 03:09:48,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:09:48,837 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-17 03:09:48,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:48,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 59 treesize of output 57 [2023-02-17 03:09:53,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:09:53,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 102 treesize of output 78 [2023-02-17 03:09:56,165 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-17 03:09:56,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:09:56,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (_ BitVec 32))) (= |c_ULTIMATE.start_main_old_#valid#1| (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_756)) |c_ULTIMATE.start_probe_19_~a#1.base|) (bvadd |c_ULTIMATE.start_probe_19_~a#1.offset| (_ bv4 32))) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~#a19~0#1.base| (_ bv0 1)))) is different from false [2023-02-17 03:09:56,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1808126579] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:09:56,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:09:56,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 23 [2023-02-17 03:09:56,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933196161] [2023-02-17 03:09:56,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:09:56,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-17 03:09:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:09:56,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-17 03:09:56,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=605, Unknown=15, NotChecked=156, Total=870 [2023-02-17 03:09:56,175 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 24 states, 20 states have (on average 2.75) internal successors, (55), 21 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-17 03:09:58,277 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-17 03:10:02,347 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-17 03:10:07,005 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-17 03:10:19,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:10:25,654 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-17 03:10:31,815 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-17 03:10:33,889 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-17 03:10:40,191 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-17 03:10:42,217 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-17 03:10:44,228 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-17 03:10:48,535 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-17 03:10:50,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:10:52,963 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-17 03:10:54,970 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-17 03:10:57,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:10:59,196 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-17 03:10:59,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:10:59,213 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2023-02-17 03:10:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 03:10:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 2.75) internal successors, (55), 21 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-17 03:10:59,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:10:59,214 INFO L225 Difference]: With dead ends: 90 [2023-02-17 03:10:59,214 INFO L226 Difference]: Without dead ends: 72 [2023-02-17 03:10:59,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=208, Invalid=1415, Unknown=29, NotChecked=240, Total=1892 [2023-02-17 03:10:59,215 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 21 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 34.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:10:59,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 486 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 515 Invalid, 17 Unknown, 70 Unchecked, 34.0s Time] [2023-02-17 03:10:59,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-17 03:10:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-17 03:10:59,217 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-17 03:10:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2023-02-17 03:10:59,217 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 32 [2023-02-17 03:10:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:10:59,217 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2023-02-17 03:10:59,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 2.75) internal successors, (55), 21 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-17 03:10:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2023-02-17 03:10:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 03:10:59,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:10:59,218 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-17 03:10:59,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:59,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2023-02-17 03:10:59,622 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-17 03:10:59,622 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-17 03:10:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:10:59,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2044973706, now seen corresponding path program 1 times [2023-02-17 03:10:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:10:59,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279585317] [2023-02-17 03:10:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:10:59,623 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-17 03:10:59,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:10:59,624 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-17 03:10:59,627 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-17 03:10:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:10:59,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:10:59,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:10:59,754 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-17 03:10:59,820 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-17 03:10:59,842 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-17 03:10:59,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:10:59,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:10:59,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279585317] [2023-02-17 03:10:59,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279585317] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:10:59,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:10:59,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-17 03:10:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680183508] [2023-02-17 03:10:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:10:59,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:10:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:10:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:10:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:10:59,844 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-17 03:11:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:11:00,202 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-02-17 03:11:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 03:11:00,203 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-17 03:11:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:11:00,203 INFO L225 Difference]: With dead ends: 75 [2023-02-17 03:11:00,203 INFO L226 Difference]: Without dead ends: 75 [2023-02-17 03:11:00,204 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-17 03:11:00,204 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 94 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:11:00,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 264 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:11:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-17 03:11:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2023-02-17 03:11:00,205 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-17 03:11:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2023-02-17 03:11:00,206 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 34 [2023-02-17 03:11:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:11:00,206 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2023-02-17 03:11:00,206 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-17 03:11:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2023-02-17 03:11:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 03:11:00,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:11:00,206 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-17 03:11:00,215 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-17 03:11:00,415 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-17 03:11:00,416 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-17 03:11:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:11:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1030324427, now seen corresponding path program 1 times [2023-02-17 03:11:00,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:11:00,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356832266] [2023-02-17 03:11:00,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:11:00,417 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-17 03:11:00,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:11:00,418 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-17 03:11:00,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2023-02-17 03:11:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:11:00,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-17 03:11:00,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:11:00,651 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-17 03:11:00,802 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-17 03:11:00,838 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-17 03:11:00,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:11:00,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:11:00,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356832266] [2023-02-17 03:11:00,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356832266] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:11:00,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:11:00,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-17 03:11:00,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417728984] [2023-02-17 03:11:00,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:11:00,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 03:11:00,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:11:00,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 03:11:00,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:11:00,840 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-17 03:11:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:11:01,970 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2023-02-17 03:11:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-17 03:11:01,971 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-17 03:11:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:11:01,971 INFO L225 Difference]: With dead ends: 74 [2023-02-17 03:11:01,971 INFO L226 Difference]: Without dead ends: 74 [2023-02-17 03:11:01,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2023-02-17 03:11:01,972 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 122 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:11:01,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 189 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 03:11:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-17 03:11:01,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2023-02-17 03:11:01,973 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-17 03:11:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2023-02-17 03:11:01,973 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 35 [2023-02-17 03:11:01,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:11:01,974 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2023-02-17 03:11:01,974 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-17 03:11:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2023-02-17 03:11:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 03:11:01,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:11:01,974 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-17 03:11:01,987 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-17 03:11:02,174 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-17 03:11:02,175 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-17 03:11:02,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:11:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1875286036, now seen corresponding path program 1 times [2023-02-17 03:11:02,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:11:02,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86004345] [2023-02-17 03:11:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:11:02,177 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-17 03:11:02,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:11:02,178 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-17 03:11:02,180 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-17 03:11:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:11:02,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-17 03:11:02,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:11:02,287 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-17 03:11:02,300 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-17 03:11:02,324 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-17 03:11:02,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:02,348 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-17 03:11:02,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:11:02,382 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-17 03:11:02,483 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 73 treesize of output 59 [2023-02-17 03:11:02,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:02,569 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-17 03:11:02,595 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-17 03:11:02,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:11:02,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:11:02,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86004345] [2023-02-17 03:11:02,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86004345] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:11:02,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:11:02,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-17 03:11:02,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039118959] [2023-02-17 03:11:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:11:02,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 03:11:02,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:11:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 03:11:02,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-02-17 03:11:02,597 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-17 03:11:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:11:03,331 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2023-02-17 03:11:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 03:11:03,332 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-17 03:11:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:11:03,332 INFO L225 Difference]: With dead ends: 73 [2023-02-17 03:11:03,332 INFO L226 Difference]: Without dead ends: 73 [2023-02-17 03:11:03,333 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-17 03:11:03,333 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 67 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:11:03,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 265 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 03:11:03,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-17 03:11:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-17 03:11:03,334 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-17 03:11:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2023-02-17 03:11:03,335 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 36 [2023-02-17 03:11:03,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:11:03,335 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2023-02-17 03:11:03,335 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-17 03:11:03,335 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2023-02-17 03:11:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 03:11:03,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:11:03,335 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-17 03:11:03,345 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-17 03:11:03,536 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-17 03:11:03,536 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-17 03:11:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:11:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1632002513, now seen corresponding path program 1 times [2023-02-17 03:11:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:11:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903088327] [2023-02-17 03:11:03,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:11:03,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-17 03:11:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:11:03,538 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-17 03:11:03,540 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-17 03:11:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:11:03,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 03:11:03,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:11:03,648 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-17 03:11:03,660 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-17 03:11:03,681 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-17 03:11:03,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:03,707 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-17 03:11:03,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:11:03,736 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-17 03:11:03,773 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-17 03:11:03,901 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-17 03:11:03,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:03,939 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-17 03:11:03,963 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-17 03:11:03,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:11:04,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:11:04,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903088327] [2023-02-17 03:11:04,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903088327] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:11:04,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [972691916] [2023-02-17 03:11:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:11:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:11:04,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:11:04,052 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-17 03:11:04,055 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-17 03:11:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:11:04,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 03:11:04,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:11:04,238 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-17 03:11:04,242 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-17 03:11:04,246 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-17 03:11:04,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:04,265 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-17 03:11:04,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:11:04,271 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-17 03:11:04,289 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-17 03:11:04,373 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-17 03:11:04,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:04,403 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-17 03:11:04,405 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-17 03:11:04,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:11:04,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [972691916] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:11:04,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:11:04,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2023-02-17 03:11:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071699841] [2023-02-17 03:11:04,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:11:04,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-17 03:11:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:11:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-17 03:11:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=240, Unknown=10, NotChecked=0, Total=306 [2023-02-17 03:11:04,470 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-17 03:11:05,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:11:05,036 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2023-02-17 03:11:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-17 03:11:05,037 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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 36 [2023-02-17 03:11:05,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:11:05,037 INFO L225 Difference]: With dead ends: 72 [2023-02-17 03:11:05,037 INFO L226 Difference]: Without dead ends: 72 [2023-02-17 03:11:05,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=437, Unknown=14, NotChecked=0, Total=552 [2023-02-17 03:11:05,038 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 6 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:11:05,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 223 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 245 Invalid, 39 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 03:11:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-17 03:11:05,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-17 03:11:05,039 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-17 03:11:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2023-02-17 03:11:05,039 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 36 [2023-02-17 03:11:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:11:05,039 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2023-02-17 03:11:05,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 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-17 03:11:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2023-02-17 03:11:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 03:11:05,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:11:05,040 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-17 03:11:05,047 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 (45)] Ended with exit code 0 [2023-02-17 03:11:05,244 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-17 03:11:05,440 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-17 03:11:05,441 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-17 03:11:05,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:11:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1333538260, now seen corresponding path program 1 times [2023-02-17 03:11:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:11:05,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191564059] [2023-02-17 03:11:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:11:05,441 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-17 03:11:05,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:11:05,443 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-17 03:11:05,445 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-17 03:11:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:11:05,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:11:05,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:11:05,605 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-17 03:11:05,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:11:05,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:11:05,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191564059] [2023-02-17 03:11:05,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191564059] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:11:05,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:11:05,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:11:05,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504029982] [2023-02-17 03:11:05,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:11:05,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:11:05,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:11:05,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:11:05,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:11:05,607 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-17 03:11:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:11:05,631 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2023-02-17 03:11:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:11:05,631 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-17 03:11:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:11:05,632 INFO L225 Difference]: With dead ends: 62 [2023-02-17 03:11:05,632 INFO L226 Difference]: Without dead ends: 62 [2023-02-17 03:11:05,632 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-17 03:11:05,632 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-17 03:11:05,632 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-17 03:11:05,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-17 03:11:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2023-02-17 03:11:05,633 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-17 03:11:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2023-02-17 03:11:05,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 40 [2023-02-17 03:11:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:11:05,634 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2023-02-17 03:11:05,634 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-17 03:11:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2023-02-17 03:11:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-17 03:11:05,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:11:05,634 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-17 03:11:05,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 (47)] Forceful destruction successful, exit code 0 [2023-02-17 03:11:05,835 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-17 03:11:05,835 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-17 03:11:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:11:05,835 INFO L85 PathProgramCache]: Analyzing trace with hash 221296187, now seen corresponding path program 1 times [2023-02-17 03:11:05,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:11:05,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331690080] [2023-02-17 03:11:05,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:11:05,836 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-17 03:11:05,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:11:05,837 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-17 03:11:05,838 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-17 03:11:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:11:05,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-17 03:11:05,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:11:06,035 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-17 03:11:06,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:06,104 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-17 03:11:06,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:11:06,175 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-17 03:11:06,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:06,409 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 240 treesize of output 262 [2023-02-17 03:11:06,540 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 0 case distinctions, treesize of input 74 treesize of output 38 [2023-02-17 03:11:11,794 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_928 (_ BitVec 1)) (v_ArrVal_927 (_ BitVec 1)) (|v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| (_ BitVec 32)) (v_ArrVal_937 (_ 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_927))) (let ((.cse0 (store .cse1 v_arrayElimCell_122 v_ArrVal_928))) (and (= |c_#valid| (store (store (store (store .cse0 v_arrayElimCell_121 v_ArrVal_937) v_arrayElimCell_122 (_ bv0 1)) v_arrayElimCell_121 (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| (_ bv0 1))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9|) (_ bv0 1)) (= (_ bv0 1) (select .cse1 v_arrayElimCell_122)) (= (_ bv0 1) (select .cse0 v_arrayElimCell_121)))))) is different from true [2023-02-17 03:11:11,796 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-17 03:11:11,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:11:11,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:11:11,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331690080] [2023-02-17 03:11:11,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331690080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:11:11,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:11:11,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-17 03:11:11,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783541682] [2023-02-17 03:11:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:11:11,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 03:11:11,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:11:11,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 03:11:11,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=236, Unknown=3, NotChecked=30, Total=306 [2023-02-17 03:11:11,798 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 16 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-17 03:11:13,834 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-17 03:11:16,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-17 03:11:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:11:17,306 INFO L93 Difference]: Finished difference Result 61 states and 60 transitions. [2023-02-17 03:11:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 03:11:17,307 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 16 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-17 03:11:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:11:17,307 INFO L225 Difference]: With dead ends: 61 [2023-02-17 03:11:17,307 INFO L226 Difference]: Without dead ends: 43 [2023-02-17 03:11:17,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=78, Invalid=523, Unknown=3, NotChecked=46, Total=650 [2023-02-17 03:11:17,308 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:11:17,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 267 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 343 Invalid, 2 Unknown, 60 Unchecked, 5.1s Time] [2023-02-17 03:11:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-17 03:11:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-17 03:11:17,309 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-17 03:11:17,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2023-02-17 03:11:17,309 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 42 [2023-02-17 03:11:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:11:17,309 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2023-02-17 03:11:17,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 16 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-17 03:11:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2023-02-17 03:11:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-17 03:11:17,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:11:17,310 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-17 03:11:17,332 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-17 03:11:17,510 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-17 03:11:17,510 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-17 03:11:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:11:17,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1630446902, now seen corresponding path program 1 times [2023-02-17 03:11:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:11:17,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779458834] [2023-02-17 03:11:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:11:17,511 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-17 03:11:17,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:11:17,513 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-17 03:11:17,514 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-17 03:11:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:11:17,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-17 03:11:17,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:11:17,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-17 03:11:17,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:17,780 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-17 03:11:17,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:11:17,841 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-17 03:11:17,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:17,922 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-17 03:11:18,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:11:18,057 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-17 03:11:24,961 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a19~0#1.base_10| (_ BitVec 32)) (v_ArrVal_959 (_ BitVec 1)) (v_ArrVal_969 (_ BitVec 1)) (v_arrayElimCell_130 (_ 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_959))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_20| v_ArrVal_969))) (and (= (_ bv0 1) (select .cse0 v_arrayElimCell_130)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_10|) (_ bv0 1)) (= (select .cse1 |v_ULTIMATE.start_probe_19_#t~mem46#1.base_20|) (_ bv0 1)) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_130 (_ 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))))))) is different from true [2023-02-17 03:11:24,963 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-17 03:11:24,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:11:24,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:11:24,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779458834] [2023-02-17 03:11:24,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779458834] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:11:24,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:11:24,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-17 03:11:24,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780431340] [2023-02-17 03:11:24,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:11:24,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-17 03:11:24,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:11:24,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-17 03:11:24,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=4, NotChecked=28, Total=272 [2023-02-17 03:11:24,965 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-17 03:11:27,037 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-17 03:11:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:11:30,166 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2023-02-17 03:11:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 03:11:30,166 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-17 03:11:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:11:30,167 INFO L225 Difference]: With dead ends: 42 [2023-02-17 03:11:30,167 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 03:11:30,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=62, Invalid=357, Unknown=5, NotChecked=38, Total=462 [2023-02-17 03:11:30,167 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:11:30,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 191 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 4 Unknown, 49 Unchecked, 3.0s Time] [2023-02-17 03:11:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 03:11:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 03:11:30,168 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-17 03:11:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 03:11:30,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2023-02-17 03:11:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:11:30,168 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 03:11:30,168 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-17 03:11:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 03:11:30,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 03:11:30,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (13 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (12 of 24 remaining) [2023-02-17 03:11:30,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (11 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (8 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (7 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (6 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (2 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE (1 of 24 remaining) [2023-02-17 03:11:30,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE (0 of 24 remaining) [2023-02-17 03:11:30,180 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 (49)] Ended with exit code 0 [2023-02-17 03:11:30,373 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-17 03:11:30,375 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-17 03:11:30,378 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 03:11:30,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 03:11:30 BoogieIcfgContainer [2023-02-17 03:11:30,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 03:11:30,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 03:11:30,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 03:11:30,380 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 03:11:30,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:08:07" (3/4) ... [2023-02-17 03:11:30,383 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-17 03:11:30,387 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2023-02-17 03:11:30,387 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f19_undo [2023-02-17 03:11:30,392 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-02-17 03:11:30,392 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-17 03:11:30,392 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-17 03:11:30,423 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 03:11:30,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 03:11:30,424 INFO L158 Benchmark]: Toolchain (without parser) took 203549.77ms. Allocated memory was 107.0MB in the beginning and 180.4MB in the end (delta: 73.4MB). Free memory was 82.1MB in the beginning and 101.4MB in the end (delta: -19.3MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2023-02-17 03:11:30,424 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 107.0MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:11:30,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.86ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 81.8MB in the beginning and 120.3MB in the end (delta: -38.5MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2023-02-17 03:11:30,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.45ms. Allocated memory is still 144.7MB. Free memory was 120.3MB in the beginning and 117.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:11:30,425 INFO L158 Benchmark]: Boogie Preprocessor took 47.22ms. Allocated memory is still 144.7MB. Free memory was 117.9MB in the beginning and 116.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:11:30,425 INFO L158 Benchmark]: RCFGBuilder took 416.02ms. Allocated memory is still 144.7MB. Free memory was 116.1MB in the beginning and 99.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-17 03:11:30,425 INFO L158 Benchmark]: TraceAbstraction took 202514.19ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 98.4MB in the beginning and 105.3MB in the end (delta: -6.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2023-02-17 03:11:30,425 INFO L158 Benchmark]: Witness Printer took 43.62ms. Allocated memory is still 180.4MB. Free memory was 105.3MB in the beginning and 101.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-17 03:11:30,427 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 107.0MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.86ms. Allocated memory was 107.0MB in the beginning and 144.7MB in the end (delta: 37.7MB). Free memory was 81.8MB in the beginning and 120.3MB in the end (delta: -38.5MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.45ms. Allocated memory is still 144.7MB. Free memory was 120.3MB in the beginning and 117.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.22ms. Allocated memory is still 144.7MB. Free memory was 117.9MB in the beginning and 116.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.02ms. Allocated memory is still 144.7MB. Free memory was 116.1MB in the beginning and 99.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 202514.19ms. Allocated memory was 144.7MB in the beginning and 180.4MB in the end (delta: 35.7MB). Free memory was 98.4MB in the beginning and 105.3MB in the end (delta: -6.9MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * Witness Printer took 43.62ms. Allocated memory is still 180.4MB. Free memory was 105.3MB in the beginning and 101.4MB in the end (delta: 4.0MB). 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: 202.5s, OverallIterations: 39, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 99.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 70 mSolverCounterUnknown, 2909 SdHoareTripleChecker+Valid, 66.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2870 mSDsluCounter, 9062 SdHoareTripleChecker+Invalid, 65.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1108 IncrementalHoareTripleChecker+Unchecked, 6999 mSDsCounter, 301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5580 IncrementalHoareTripleChecker+Invalid, 7059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 301 mSolverCounterUnsat, 2063 mSDtfsCounter, 5580 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1653 GetRequests, 1135 SyntacticMatches, 35 SemanticMatches, 483 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 119.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=14, InterpolantAutomatonStates: 405, 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, 515 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 88.0s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 1289 ConstructedInterpolants, 265 QuantifiedInterpolants, 18034 SizeOfPredicates, 485 NumberOfNonLiveVariables, 5883 ConjunctsInSsa, 890 ConjunctsInUnsatCore, 48 InterpolantComputations, 31 PerfectInterpolantSequences, 134/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-17 03:11:30,516 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