./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:09:35,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:09:35,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:09:35,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:09:35,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:09:35,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:09:35,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:09:35,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:09:35,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:09:35,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:09:35,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:09:35,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:09:35,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:09:35,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:09:35,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:09:35,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:09:35,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:09:35,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:09:35,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:09:35,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:09:35,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:09:35,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:09:35,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:09:35,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:09:35,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:09:35,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:09:35,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:09:35,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:09:35,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:09:35,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:09:35,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:09:35,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:09:35,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:09:35,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:09:35,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:09:35,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:09:35,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:09:35,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:09:35,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:09:35,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:09:35,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:09:35,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:09:35,718 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:09:35,719 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:09:35,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:09:35,720 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:09:35,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:09:35,721 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:09:35,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:09:35,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:09:35,722 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:09:35,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:09:35,723 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:09:35,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:09:35,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:09:35,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:09:35,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:09:35,724 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:09:35,724 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:09:35,724 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:09:35,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:09:35,725 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:09:35,725 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:09:35,725 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:09:35,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:09:35,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:09:35,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:09:35,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:09:35,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:09:35,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:09:35,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:09:35,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:09:35,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:09:35,727 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:09:35,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:09:35,728 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:09:35,728 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 -> 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f [2023-02-15 13:09:35,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:09:35,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:09:35,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:09:35,997 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:09:35,997 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:09:35,999 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2023-02-15 13:09:37,119 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:09:37,378 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:09:37,378 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2023-02-15 13:09:37,388 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44356bc90/832243edbb214691ad243f3fbadf55af/FLAGe41101149 [2023-02-15 13:09:37,400 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44356bc90/832243edbb214691ad243f3fbadf55af [2023-02-15 13:09:37,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:09:37,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:09:37,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:09:37,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:09:37,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:09:37,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:09:37" (1/1) ... [2023-02-15 13:09:37,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc51812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:37, skipping insertion in model container [2023-02-15 13:09:37,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:09:37" (1/1) ... [2023-02-15 13:09:37,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:09:37,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:09:37,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:09:37,796 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-15 13:09:37,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4c000ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:37, skipping insertion in model container [2023-02-15 13:09:37,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:09:37,799 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 13:09:37,801 INFO L158 Benchmark]: Toolchain (without parser) took 396.03ms. Allocated memory is still 123.7MB. Free memory was 78.8MB in the beginning and 64.8MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 13:09:37,802 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 123.7MB. Free memory was 92.7MB in the beginning and 92.6MB in the end (delta: 92.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:09:37,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.97ms. Allocated memory is still 123.7MB. Free memory was 78.5MB in the beginning and 64.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 13:09:37,804 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.19ms. Allocated memory is still 123.7MB. Free memory was 92.7MB in the beginning and 92.6MB in the end (delta: 92.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.97ms. Allocated memory is still 123.7MB. Free memory was 78.5MB in the beginning and 64.8MB 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:09:39,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:09:39,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:09:39,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:09:39,670 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:09:39,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:09:39,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:09:39,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:09:39,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:09:39,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:09:39,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:09:39,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:09:39,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:09:39,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:09:39,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:09:39,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:09:39,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:09:39,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:09:39,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:09:39,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:09:39,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:09:39,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:09:39,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:09:39,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:09:39,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:09:39,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:09:39,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:09:39,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:09:39,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:09:39,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:09:39,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:09:39,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:09:39,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:09:39,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:09:39,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:09:39,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:09:39,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:09:39,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:09:39,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:09:39,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:09:39,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:09:39,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 13:09:39,764 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:09:39,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:09:39,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:09:39,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:09:39,770 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:09:39,770 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:09:39,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:09:39,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:09:39,771 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:09:39,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:09:39,772 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:09:39,773 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:09:39,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:09:39,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:09:39,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:09:39,773 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:09:39,774 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:09:39,774 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:09:39,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:09:39,774 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:09:39,774 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:09:39,774 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:09:39,775 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:09:39,775 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:09:39,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:09:39,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:09:39,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:09:39,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:09:39,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:09:39,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:09:39,776 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:09:39,776 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:09:39,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:09:39,777 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:09:39,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:09:39,777 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:09:39,778 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:09:39,778 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 -> 1df2ca055a97db0a00e0c4b03f212c5ac3c2765d37b628ab5708f179a281754f [2023-02-15 13:09:40,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:09:40,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:09:40,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:09:40,110 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:09:40,111 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:09:40,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2023-02-15 13:09:41,289 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:09:41,555 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:09:41,559 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test19-2.i [2023-02-15 13:09:41,574 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cea3d68b/41c3962975684f959265da48295b8f03/FLAG8400763b9 [2023-02-15 13:09:41,588 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cea3d68b/41c3962975684f959265da48295b8f03 [2023-02-15 13:09:41,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:09:41,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:09:41,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:09:41,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:09:41,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:09:41,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:09:41" (1/1) ... [2023-02-15 13:09:41,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a4e428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:41, skipping insertion in model container [2023-02-15 13:09:41,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:09:41" (1/1) ... [2023-02-15 13:09:41,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:09:41,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:09:42,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:09:42,022 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 13:09:42,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:09:42,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:09:42,110 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:09:42,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:09:42,218 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:09:42,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42 WrapperNode [2023-02-15 13:09:42,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:09:42,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:09:42,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:09:42,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:09:42,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,289 INFO L138 Inliner]: procedures = 171, calls = 87, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 76 [2023-02-15 13:09:42,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:09:42,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:09:42,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:09:42,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:09:42,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,329 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:09:42,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:09:42,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:09:42,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:09:42,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (1/1) ... [2023-02-15 13:09:42,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:09:42,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:09:42,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:09:42,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:09:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure f19_undo [2023-02-15 13:09:42,407 INFO L138 BoogieDeclarations]: Found implementation of procedure f19_undo [2023-02-15 13:09:42,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-15 13:09:42,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-15 13:09:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:09:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:09:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:09:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:09:42,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:09:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:09:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:09:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:09:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:09:42,556 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:09:42,563 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:09:42,782 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:09:42,787 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:09:42,790 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-15 13:09:42,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:09:42 BoogieIcfgContainer [2023-02-15 13:09:42,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:09:42,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:09:42,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:09:42,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:09:42,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:09:41" (1/3) ... [2023-02-15 13:09:42,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370a6bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:09:42, skipping insertion in model container [2023-02-15 13:09:42,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:09:42" (2/3) ... [2023-02-15 13:09:42,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370a6bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:09:42, skipping insertion in model container [2023-02-15 13:09:42,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:09:42" (3/3) ... [2023-02-15 13:09:42,806 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test19-2.i [2023-02-15 13:09:42,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:09:42,820 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-02-15 13:09:42,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:09:42,856 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;@5c31e1c0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:09:42,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-02-15 13:09:42,860 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-15 13:09:42,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 13:09:42,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:42,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:42,866 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-15 13:09:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:42,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1461209413, now seen corresponding path program 1 times [2023-02-15 13:09:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:42,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865674244] [2023-02-15 13:09:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:42,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:42,889 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:42,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 13:09:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:43,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:09:43,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:43,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:09:43,142 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-15 13:09:43,165 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:09:43,166 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 14 treesize of output 20 [2023-02-15 13:09:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:09:43,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:43,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:43,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865674244] [2023-02-15 13:09:43,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865674244] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:43,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:43,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:09:43,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081509138] [2023-02-15 13:09:43,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:43,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:09:43,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:09:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 13:09:43,214 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-15 13:09:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:43,412 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2023-02-15 13:09:43,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:09:43,416 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-15 13:09:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:43,423 INFO L225 Difference]: With dead ends: 98 [2023-02-15 13:09:43,424 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 13:09:43,427 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-15 13:09:43,434 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.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:43,436 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.2s Time] [2023-02-15 13:09:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 13:09:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 75. [2023-02-15 13:09:43,478 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-15 13:09:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2023-02-15 13:09:43,483 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 8 [2023-02-15 13:09:43,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:43,484 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2023-02-15 13:09:43,484 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-15 13:09:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2023-02-15 13:09:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 13:09:43,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:43,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:43,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 13:09:43,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:43,697 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-15 13:09:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1461209414, now seen corresponding path program 1 times [2023-02-15 13:09:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:43,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890974881] [2023-02-15 13:09:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:43,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:43,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:43,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:43,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 13:09:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:43,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:09:43,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:43,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:09:43,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:09:43,825 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-15 13:09:43,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:09:43,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:09:43,869 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:09:43,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:09:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:09:43,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:43,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:43,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890974881] [2023-02-15 13:09:43,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890974881] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:43,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:43,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:09:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657105089] [2023-02-15 13:09:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:43,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:09:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:09:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-15 13:09:43,886 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-15 13:09:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:44,081 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2023-02-15 13:09:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:09:44,081 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-15 13:09:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:44,083 INFO L225 Difference]: With dead ends: 120 [2023-02-15 13:09:44,083 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 13:09:44,083 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-15 13:09:44,084 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 108 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:44,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 154 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 111 Invalid, 0 Unknown, 119 Unchecked, 0.2s Time] [2023-02-15 13:09:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 13:09:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 77. [2023-02-15 13:09:44,091 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-15 13:09:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2023-02-15 13:09:44,092 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 8 [2023-02-15 13:09:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:44,092 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2023-02-15 13:09:44,095 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-15 13:09:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2023-02-15 13:09:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:09:44,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:44,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:44,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:44,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:44,306 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-15 13:09:44,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1807662222, now seen corresponding path program 1 times [2023-02-15 13:09:44,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:44,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208740331] [2023-02-15 13:09:44,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:44,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:44,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:44,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:44,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 13:09:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:44,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:09:44,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:44,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:09:44,437 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-15 13:09:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:09:44,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:44,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:44,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208740331] [2023-02-15 13:09:44,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208740331] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:44,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:44,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:09:44,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004505472] [2023-02-15 13:09:44,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:44,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:09:44,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:44,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:09:44,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:09:44,458 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-15 13:09:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:44,569 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2023-02-15 13:09:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:09:44,570 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-15 13:09:44,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:44,570 INFO L225 Difference]: With dead ends: 86 [2023-02-15 13:09:44,571 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 13:09:44,571 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-15 13:09:44,571 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 5 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-15 13:09:44,572 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-15 13:09:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 13:09:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2023-02-15 13:09:44,578 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-15 13:09:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 98 transitions. [2023-02-15 13:09:44,579 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 98 transitions. Word has length 15 [2023-02-15 13:09:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:44,579 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 98 transitions. [2023-02-15 13:09:44,579 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-15 13:09:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 98 transitions. [2023-02-15 13:09:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 13:09:44,581 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:44,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:44,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:44,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:44,792 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-15 13:09:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:44,793 INFO L85 PathProgramCache]: Analyzing trace with hash 690353715, now seen corresponding path program 1 times [2023-02-15 13:09:44,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:44,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022280042] [2023-02-15 13:09:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:44,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:44,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:44,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:44,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 13:09:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:44,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:09:44,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:09:44,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:44,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:44,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022280042] [2023-02-15 13:09:44,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022280042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:44,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:44,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:09:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889393887] [2023-02-15 13:09:44,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:44,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:09:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:09:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:09:44,942 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-15 13:09:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:44,973 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2023-02-15 13:09:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:09:44,974 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-15 13:09:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:44,975 INFO L225 Difference]: With dead ends: 88 [2023-02-15 13:09:44,975 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 13:09:44,975 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-15 13:09:44,976 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 25 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:44,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 251 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:09:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 13:09:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-02-15 13:09:44,988 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-15 13:09:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2023-02-15 13:09:44,990 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 15 [2023-02-15 13:09:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:44,991 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2023-02-15 13:09:44,994 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-15 13:09:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2023-02-15 13:09:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:09:44,995 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:44,995 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:45,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:45,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:45,205 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-15 13:09:45,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:45,205 INFO L85 PathProgramCache]: Analyzing trace with hash 891124571, now seen corresponding path program 1 times [2023-02-15 13:09:45,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:45,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835563680] [2023-02-15 13:09:45,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:45,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:45,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:45,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:45,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 13:09:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:45,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:09:45,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:45,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:09:45,317 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-15 13:09:45,337 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:09:45,337 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 14 treesize of output 20 [2023-02-15 13:09:45,347 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-15 13:09:45,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:45,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:45,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835563680] [2023-02-15 13:09:45,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835563680] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:45,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:45,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:09:45,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996298289] [2023-02-15 13:09:45,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:45,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:09:45,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:45,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:09:45,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-15 13:09:45,350 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-15 13:09:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:45,519 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2023-02-15 13:09:45,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:09:45,520 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-15 13:09:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:45,520 INFO L225 Difference]: With dead ends: 118 [2023-02-15 13:09:45,520 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 13:09:45,520 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-15 13:09:45,521 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-15 13:09:45,521 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-15 13:09:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 13:09:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2023-02-15 13:09:45,526 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-15 13:09:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2023-02-15 13:09:45,527 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 17 [2023-02-15 13:09:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:45,527 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2023-02-15 13:09:45,528 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-15 13:09:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2023-02-15 13:09:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:09:45,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:45,528 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:45,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:45,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:45,739 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-15 13:09:45,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 891124572, now seen corresponding path program 1 times [2023-02-15 13:09:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:45,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621208212] [2023-02-15 13:09:45,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:45,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:45,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:45,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:45,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 13:09:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:45,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 13:09:45,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:45,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:09:45,926 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-15 13:09:45,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:09:45,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:09:45,975 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:09:45,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:09:45,992 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-15 13:09:45,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:45,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:45,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621208212] [2023-02-15 13:09:45,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621208212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:45,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:45,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:09:45,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624536563] [2023-02-15 13:09:45,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:45,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:09:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:09:45,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2023-02-15 13:09:45,995 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:09:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:46,373 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2023-02-15 13:09:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:09:46,373 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:09:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:46,374 INFO L225 Difference]: With dead ends: 148 [2023-02-15 13:09:46,374 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 13:09:46,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=73, Unknown=1, NotChecked=18, Total=132 [2023-02-15 13:09:46,375 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 158 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:46,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 264 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 244 Invalid, 0 Unknown, 107 Unchecked, 0.3s Time] [2023-02-15 13:09:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 13:09:46,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 80. [2023-02-15 13:09:46,381 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-15 13:09:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-02-15 13:09:46,381 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 17 [2023-02-15 13:09:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:46,382 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-02-15 13:09:46,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:09:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-02-15 13:09:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:09:46,382 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:46,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:46,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:46,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:46,584 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-15 13:09:46,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2005389781, now seen corresponding path program 1 times [2023-02-15 13:09:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:46,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877374907] [2023-02-15 13:09:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:46,586 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:46,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 13:09:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:46,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:09:46,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:46,725 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-15 13:09:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:09:46,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:46,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:46,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877374907] [2023-02-15 13:09:46,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877374907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:46,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:46,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:09:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998539286] [2023-02-15 13:09:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:46,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:09:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:09:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 13:09:46,738 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-15 13:09:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:46,867 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2023-02-15 13:09:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:09:46,868 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-15 13:09:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:46,869 INFO L225 Difference]: With dead ends: 111 [2023-02-15 13:09:46,869 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 13:09:46,869 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-15 13:09:46,870 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 36 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 186 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-15 13:09:46,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 186 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2023-02-15 13:09:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 13:09:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-02-15 13:09:46,874 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-15 13:09:46,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2023-02-15 13:09:46,875 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 17 [2023-02-15 13:09:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:46,875 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2023-02-15 13:09:46,875 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-15 13:09:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2023-02-15 13:09:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:09:46,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:46,876 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-15 13:09:46,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:47,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:47,082 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-15 13:09:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1867537779, now seen corresponding path program 1 times [2023-02-15 13:09:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:47,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931203084] [2023-02-15 13:09:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:47,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:47,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:47,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:47,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 13:09:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:47,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:09:47,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:47,164 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-15 13:09:47,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:47,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:47,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931203084] [2023-02-15 13:09:47,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931203084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:47,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:47,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:09:47,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415613756] [2023-02-15 13:09:47,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:47,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:09:47,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:09:47,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:09:47,179 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-15 13:09:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:47,204 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2023-02-15 13:09:47,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:09:47,204 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-15 13:09:47,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:47,206 INFO L225 Difference]: With dead ends: 159 [2023-02-15 13:09:47,206 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 13:09:47,206 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-15 13:09:47,206 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 90 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:47,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 205 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:09:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 13:09:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 94. [2023-02-15 13:09:47,211 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-15 13:09:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2023-02-15 13:09:47,212 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 23 [2023-02-15 13:09:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:47,213 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2023-02-15 13:09:47,213 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-15 13:09:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2023-02-15 13:09:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:09:47,214 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:47,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:09:47,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:47,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:47,423 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-15 13:09:47,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:47,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1867478197, now seen corresponding path program 1 times [2023-02-15 13:09:47,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:47,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537269666] [2023-02-15 13:09:47,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:47,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:47,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:47,426 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:47,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 13:09:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:47,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:09:47,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:47,521 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-15 13:09:47,533 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-15 13:09:47,541 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-15 13:09:47,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:47,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:47,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537269666] [2023-02-15 13:09:47,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537269666] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:47,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:47,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:09:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503292461] [2023-02-15 13:09:47,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:47,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:09:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:09:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:09:47,544 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-15 13:09:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:47,614 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2023-02-15 13:09:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:09:47,615 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-15 13:09:47,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:47,616 INFO L225 Difference]: With dead ends: 117 [2023-02-15 13:09:47,616 INFO L226 Difference]: Without dead ends: 117 [2023-02-15 13:09:47,616 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-15 13:09:47,617 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:47,617 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.1s Time] [2023-02-15 13:09:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-15 13:09:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 92. [2023-02-15 13:09:47,620 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-15 13:09:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2023-02-15 13:09:47,621 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 23 [2023-02-15 13:09:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:47,621 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2023-02-15 13:09:47,621 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-15 13:09:47,622 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2023-02-15 13:09:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:09:47,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:47,623 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-15 13:09:47,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:47,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:47,832 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-15 13:09:47,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash 440766702, now seen corresponding path program 1 times [2023-02-15 13:09:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:47,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203136353] [2023-02-15 13:09:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:47,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:47,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:47,834 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:47,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 13:09:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:47,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:09:47,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:47,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:09:48,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:09:48,031 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-15 13:09:48,059 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-15 13:09:48,068 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-15 13:09:48,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:09:50,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203136353] [2023-02-15 13:09:50,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203136353] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:09:50,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1853172876] [2023-02-15 13:09:50,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:50,138 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:09:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:09:50,140 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-15 13:09:50,140 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-15 13:09:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:50,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 13:09:50,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:50,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:09:50,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:09:50,356 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-15 13:09:50,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:09:50,384 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-15 13:09:50,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:09:52,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1853172876] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:09:52,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:09:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-15 13:09:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573149906] [2023-02-15 13:09:52,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:09:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:09:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:09:52,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=80, Unknown=1, NotChecked=0, Total=110 [2023-02-15 13:09:52,435 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-15 13:09:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:52,581 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2023-02-15 13:09:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:09:52,581 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-15 13:09:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:52,582 INFO L225 Difference]: With dead ends: 91 [2023-02-15 13:09:52,582 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 13:09:52,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=64, Invalid=175, Unknown=1, NotChecked=0, Total=240 [2023-02-15 13:09:52,583 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 113 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:52,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 188 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:09:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 13:09:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-15 13:09:52,586 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-15 13:09:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2023-02-15 13:09:52,587 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 24 [2023-02-15 13:09:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:52,587 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2023-02-15 13:09:52,587 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-15 13:09:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2023-02-15 13:09:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:09:52,588 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:52,588 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-15 13:09:52,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:52,800 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-15 13:09:52,998 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-15 13:09:52,998 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-15 13:09:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash 778865962, now seen corresponding path program 1 times [2023-02-15 13:09:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:52,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306655843] [2023-02-15 13:09:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:53,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:53,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 (13)] Waiting until timeout for monitored process [2023-02-15 13:09:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:53,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:09:53,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:53,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:09:53,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:09:53,360 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-15 13:09:53,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 13:09:53,435 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-15 13:09:53,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:09:53,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:53,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306655843] [2023-02-15 13:09:53,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306655843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:09:53,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2033894785] [2023-02-15 13:09:53,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:53,602 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:09:53,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:09:53,604 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-15 13:09:53,605 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-15 13:09:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:53,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 13:09:53,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:53,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:09:56,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:09:56,059 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-15 13:09:56,091 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-15 13:09:56,096 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-15 13:09:56,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:09:56,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2033894785] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:09:56,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:09:56,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-02-15 13:09:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959626489] [2023-02-15 13:09:56,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:09:56,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 13:09:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:56,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 13:09:56,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=256, Unknown=1, NotChecked=0, Total=342 [2023-02-15 13:09:56,190 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-15 13:09:56,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:56,784 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2023-02-15 13:09:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 13:09:56,784 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-15 13:09:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:56,785 INFO L225 Difference]: With dead ends: 151 [2023-02-15 13:09:56,785 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 13:09:56,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=177, Invalid=578, Unknown=1, NotChecked=0, Total=756 [2023-02-15 13:09:56,786 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 167 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:09:56,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 282 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:09:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 13:09:56,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 102. [2023-02-15 13:09:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 89 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 13:09:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2023-02-15 13:09:56,789 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 25 [2023-02-15 13:09:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:56,789 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2023-02-15 13:09:56,790 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-15 13:09:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2023-02-15 13:09:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:09:56,791 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:56,791 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-15 13:09:56,795 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-15 13:09:57,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:57,193 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-15 13:09:57,193 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-15 13:09:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1765484354, now seen corresponding path program 1 times [2023-02-15 13:09:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:57,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495231544] [2023-02-15 13:09:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:57,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:57,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:57,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 13:09:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:57,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:09:57,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:57,339 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-15 13:09:57,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:57,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:57,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495231544] [2023-02-15 13:09:57,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495231544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:57,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:57,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:09:57,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062439877] [2023-02-15 13:09:57,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:57,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:09:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:09:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:09:57,341 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:09:57,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:57,494 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2023-02-15 13:09:57,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:09:57,495 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-15 13:09:57,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:57,495 INFO L225 Difference]: With dead ends: 123 [2023-02-15 13:09:57,496 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 13:09:57,496 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-15 13:09:57,496 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-15 13:09:57,496 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-15 13:09:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 13:09:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2023-02-15 13:09:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 90 states have internal predecessors, (103), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 13:09:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-02-15 13:09:57,500 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 27 [2023-02-15 13:09:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:57,501 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-02-15 13:09:57,501 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-15 13:09:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-02-15 13:09:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:09:57,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:57,502 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-15 13:09:57,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:57,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:57,703 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-15 13:09:57,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:57,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1765484353, now seen corresponding path program 1 times [2023-02-15 13:09:57,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:57,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470153278] [2023-02-15 13:09:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:57,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:57,705 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:57,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 13:09:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:57,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:09:57,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:57,895 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-15 13:09:57,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:09:57,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:09:57,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470153278] [2023-02-15 13:09:57,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470153278] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:09:57,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:09:57,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:09:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048610545] [2023-02-15 13:09:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:09:57,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:09:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:09:57,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:09:57,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:09:57,897 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:09:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:09:58,073 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-15 13:09:58,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:09:58,073 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-15 13:09:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:09:58,074 INFO L225 Difference]: With dead ends: 112 [2023-02-15 13:09:58,074 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 13:09:58,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:09:58,075 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-15 13:09:58,075 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-15 13:09:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 13:09:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2023-02-15 13:09:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.345679012345679) internal successors, (109), 95 states have internal predecessors, (109), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 13:09:58,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2023-02-15 13:09:58,079 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 27 [2023-02-15 13:09:58,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:09:58,079 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2023-02-15 13:09:58,079 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-15 13:09:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2023-02-15 13:09:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:09:58,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:09:58,080 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-15 13:09:58,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:09:58,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:58,280 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-15 13:09:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:09:58,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1624958864, now seen corresponding path program 1 times [2023-02-15 13:09:58,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:09:58,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855994983] [2023-02-15 13:09:58,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:09:58,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:09:58,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:09:58,282 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:09:58,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 13:09:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:09:58,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 13:09:58,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:09:58,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:09:58,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:09:58,443 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 5 [2023-02-15 13:09:58,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:09:58,473 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 25 treesize of output 24 [2023-02-15 13:09:58,501 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 11 [2023-02-15 13:09:58,515 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-15 13:09:58,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:00,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855994983] [2023-02-15 13:10:00,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855994983] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [153458639] [2023-02-15 13:10:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:00,619 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:10:00,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:10:00,620 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-15 13:10:00,622 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-15 13:10:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:00,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:10:00,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:00,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:00,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:00,814 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 5 [2023-02-15 13:10:00,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:00,847 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 25 treesize of output 24 [2023-02-15 13:10:00,886 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 11 [2023-02-15 13:10:00,895 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-15 13:10:00,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [153458639] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:03,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:10:03,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-15 13:10:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437419127] [2023-02-15 13:10:03,003 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:10:03,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:10:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:10:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2023-02-15 13:10:03,004 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand has 9 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:10:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:03,339 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2023-02-15 13:10:03,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:10:03,340 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-15 13:10:03,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:03,341 INFO L225 Difference]: With dead ends: 126 [2023-02-15 13:10:03,341 INFO L226 Difference]: Without dead ends: 126 [2023-02-15 13:10:03,341 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-15 13:10:03,342 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 77 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:03,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 329 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:10:03,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-15 13:10:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2023-02-15 13:10:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 99 states have internal predecessors, (113), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2023-02-15 13:10:03,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2023-02-15 13:10:03,346 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 26 [2023-02-15 13:10:03,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:03,346 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2023-02-15 13:10:03,346 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-15 13:10:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2023-02-15 13:10:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:10:03,347 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:03,347 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-15 13:10:03,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-15 13:10:03,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:03,758 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-15 13:10:03,758 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-15 13:10:03,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash 631952143, now seen corresponding path program 1 times [2023-02-15 13:10:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:03,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167852102] [2023-02-15 13:10:03,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:03,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:03,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:03,760 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:03,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 13:10:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:03,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:10:03,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:03,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:03,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:03,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 13:10:03,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 13:10:03,928 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-15 13:10:03,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:03,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:03,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167852102] [2023-02-15 13:10:03,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167852102] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:03,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:03,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747575904] [2023-02-15 13:10:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:03,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:10:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:10:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:10:03,930 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:10:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:04,047 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2023-02-15 13:10:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:10:04,048 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-15 13:10:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:04,049 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:10:04,049 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 13:10:04,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 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-15 13:10:04,050 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-15 13:10:04,050 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-15 13:10:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 13:10:04,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 13:10:04,052 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-15 13:10:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2023-02-15 13:10:04,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 26 [2023-02-15 13:10:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:04,053 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2023-02-15 13:10:04,053 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-15 13:10:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2023-02-15 13:10:04,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:10:04,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:04,054 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-15 13:10:04,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:04,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:04,254 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-15 13:10:04,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1765464909, now seen corresponding path program 1 times [2023-02-15 13:10:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:04,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332884931] [2023-02-15 13:10:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:04,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:04,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:04,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:04,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 13:10:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:04,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:10:04,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:04,424 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-15 13:10:04,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:04,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:04,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332884931] [2023-02-15 13:10:04,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332884931] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:04,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:04,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:10:04,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057747829] [2023-02-15 13:10:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:04,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:10:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:10:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:10:04,426 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-15 13:10:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:04,579 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2023-02-15 13:10:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:10:04,579 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-15 13:10:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:04,580 INFO L225 Difference]: With dead ends: 98 [2023-02-15 13:10:04,580 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 13:10:04,580 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-15 13:10:04,581 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-15 13:10:04,581 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-15 13:10:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 13:10:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2023-02-15 13:10:04,593 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-15 13:10:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2023-02-15 13:10:04,594 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 27 [2023-02-15 13:10:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:04,595 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2023-02-15 13:10:04,595 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-15 13:10:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2023-02-15 13:10:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:10:04,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:04,595 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-15 13:10:04,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:04,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:04,805 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-15 13:10:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1765464908, now seen corresponding path program 1 times [2023-02-15 13:10:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390195453] [2023-02-15 13:10:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:04,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:04,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:04,806 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:04,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 13:10:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:04,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:10:04,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:04,991 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-15 13:10:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:05,006 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 14 treesize of output 16 [2023-02-15 13:10:05,016 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:10:05,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:10:05,127 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-15 13:10:05,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:05,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390195453] [2023-02-15 13:10:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390195453] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:05,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:05,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:10:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479378719] [2023-02-15 13:10:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:05,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:10:05,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:10:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-15 13:10:05,129 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-15 13:10:05,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:05,672 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2023-02-15 13:10:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:10:05,673 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-15 13:10:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:05,674 INFO L225 Difference]: With dead ends: 123 [2023-02-15 13:10:05,674 INFO L226 Difference]: Without dead ends: 123 [2023-02-15 13:10:05,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=90, Unknown=1, NotChecked=20, Total=156 [2023-02-15 13:10:05,674 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 116 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:05,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 197 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 206 Invalid, 0 Unknown, 92 Unchecked, 0.4s Time] [2023-02-15 13:10:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-02-15 13:10:05,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2023-02-15 13:10:05,677 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-15 13:10:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-02-15 13:10:05,678 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 27 [2023-02-15 13:10:05,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:05,678 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-02-15 13:10:05,678 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-15 13:10:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-02-15 13:10:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:10:05,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:05,679 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-15 13:10:05,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:05,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:05,888 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-15 13:10:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1104559937, now seen corresponding path program 1 times [2023-02-15 13:10:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:05,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095113349] [2023-02-15 13:10:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:05,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:05,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:05,890 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:05,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 13:10:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:05,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:10:05,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:06,055 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-15 13:10:06,128 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-15 13:10:06,147 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-15 13:10:06,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:06,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:06,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095113349] [2023-02-15 13:10:06,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095113349] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:06,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:06,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:10:06,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340912564] [2023-02-15 13:10:06,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:06,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:10:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:06,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:10:06,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:10:06,149 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-15 13:10:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:06,420 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-15 13:10:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:10:06,421 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-15 13:10:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:06,421 INFO L225 Difference]: With dead ends: 91 [2023-02-15 13:10:06,421 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 13:10:06,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:10:06,422 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 83 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:06,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 302 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:10:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 13:10:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2023-02-15 13:10:06,424 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-15 13:10:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2023-02-15 13:10:06,425 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 28 [2023-02-15 13:10:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:06,425 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2023-02-15 13:10:06,425 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-15 13:10:06,425 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2023-02-15 13:10:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:10:06,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:06,426 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-15 13:10:06,439 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-15 13:10:06,632 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-15 13:10:06,632 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-15 13:10:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1105162709, now seen corresponding path program 1 times [2023-02-15 13:10:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:06,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440428971] [2023-02-15 13:10:06,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:06,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:06,634 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:06,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-15 13:10:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:06,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:10:06,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:06,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:06,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:06,958 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-15 13:10:07,047 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-15 13:10:07,065 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-15 13:10:07,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:09,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:09,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440428971] [2023-02-15 13:10:09,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440428971] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:09,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1373856064] [2023-02-15 13:10:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:09,196 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:10:09,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:10:09,197 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-15 13:10:09,198 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-15 13:10:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:09,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:10:09,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:09,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:09,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:09,459 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-15 13:10:09,509 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-15 13:10:09,512 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-15 13:10:09,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:11,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1373856064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:11,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:10:11,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-15 13:10:11,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090006312] [2023-02-15 13:10:11,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:10:11,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:10:11,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:11,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:10:11,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2023-02-15 13:10:11,617 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-15 13:10:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:12,102 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2023-02-15 13:10:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:10:12,103 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-15 13:10:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:12,103 INFO L225 Difference]: With dead ends: 92 [2023-02-15 13:10:12,103 INFO L226 Difference]: Without dead ends: 92 [2023-02-15 13:10:12,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=102, Invalid=317, Unknown=1, NotChecked=0, Total=420 [2023-02-15 13:10:12,104 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 165 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:12,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 243 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:10:12,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-15 13:10:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2023-02-15 13:10:12,106 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-15 13:10:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2023-02-15 13:10:12,107 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 28 [2023-02-15 13:10:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:12,107 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2023-02-15 13:10:12,107 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-15 13:10:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2023-02-15 13:10:12,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:10:12,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:12,107 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-15 13:10:12,113 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-15 13:10:12,314 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 (23)] Ended with exit code 0 [2023-02-15 13:10:12,508 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-15 13:10:12,508 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-15 13:10:12,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:12,509 INFO L85 PathProgramCache]: Analyzing trace with hash -118380194, now seen corresponding path program 1 times [2023-02-15 13:10:12,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:12,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059287625] [2023-02-15 13:10:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:12,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:12,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:12,510 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:12,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-15 13:10:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:12,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:10:12,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:12,860 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-15 13:10:13,079 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-15 13:10:13,126 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-15 13:10:13,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:13,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:13,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059287625] [2023-02-15 13:10:13,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059287625] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:13,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:13,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:10:13,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930600152] [2023-02-15 13:10:13,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:13,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:10:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:13,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:10:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:10:13,128 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-15 13:10:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:13,931 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-02-15 13:10:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:10:13,932 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-15 13:10:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:13,932 INFO L225 Difference]: With dead ends: 89 [2023-02-15 13:10:13,932 INFO L226 Difference]: Without dead ends: 89 [2023-02-15 13:10:13,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:10:13,933 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 111 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 234 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 13:10:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-15 13:10:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2023-02-15 13:10:13,935 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-15 13:10:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2023-02-15 13:10:13,936 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 29 [2023-02-15 13:10:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:13,936 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2023-02-15 13:10:13,936 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-15 13:10:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2023-02-15 13:10:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:10:13,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:13,937 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-15 13:10:13,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-02-15 13:10:14,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:14,145 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-15 13:10:14,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash -99262379, now seen corresponding path program 1 times [2023-02-15 13:10:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:14,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956033556] [2023-02-15 13:10:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:14,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:14,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:14,147 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:14,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-15 13:10:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:14,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:10:14,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:14,222 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-15 13:10:14,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:14,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:14,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956033556] [2023-02-15 13:10:14,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956033556] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:14,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:14,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:10:14,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159954682] [2023-02-15 13:10:14,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:14,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:10:14,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:14,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:10:14,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:10:14,224 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-15 13:10:14,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:14,259 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2023-02-15 13:10:14,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:10:14,260 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-15 13:10:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:14,260 INFO L225 Difference]: With dead ends: 103 [2023-02-15 13:10:14,260 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 13:10:14,261 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-15 13:10:14,261 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-15 13:10:14,261 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-15 13:10:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 13:10:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 88. [2023-02-15 13:10:14,264 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-15 13:10:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-15 13:10:14,265 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2023-02-15 13:10:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:14,265 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-15 13:10:14,265 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-15 13:10:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-15 13:10:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:10:14,266 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:14,266 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-15 13:10:14,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:14,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:14,474 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-15 13:10:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash -99694285, now seen corresponding path program 1 times [2023-02-15 13:10:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:14,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077312817] [2023-02-15 13:10:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:14,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:14,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:14,476 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:14,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-15 13:10:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:14,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:10:14,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:14,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:14,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:14,813 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-15 13:10:14,908 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-15 13:10:14,936 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-15 13:10:14,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:17,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2077312817] [2023-02-15 13:10:17,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2077312817] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:17,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1383323190] [2023-02-15 13:10:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:17,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:10:17,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:10:17,177 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-15 13:10:17,180 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-15 13:10:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:17,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:10:17,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:17,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:17,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:17,508 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-15 13:10:17,603 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-15 13:10:17,612 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-15 13:10:17,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:19,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1383323190] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:19,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:10:19,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-15 13:10:19,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602124842] [2023-02-15 13:10:19,783 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:10:19,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:10:19,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:10:19,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2023-02-15 13:10:19,784 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-15 13:10:21,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:10:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:22,485 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2023-02-15 13:10:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:10:22,486 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-15 13:10:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:22,486 INFO L225 Difference]: With dead ends: 91 [2023-02-15 13:10:22,487 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 13:10:22,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=86, Invalid=255, Unknown=1, NotChecked=0, Total=342 [2023-02-15 13:10:22,487 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 105 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:22,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 221 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2023-02-15 13:10:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 13:10:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-02-15 13:10:22,490 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-15 13:10:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2023-02-15 13:10:22,490 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 29 [2023-02-15 13:10:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:22,490 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2023-02-15 13:10:22,491 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-15 13:10:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2023-02-15 13:10:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:10:22,491 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:22,491 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-15 13:10:22,500 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 (27)] Ended with exit code 0 [2023-02-15 13:10:22,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-02-15 13:10:22,900 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-15 13:10:22,901 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-15 13:10:22,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash 625181411, now seen corresponding path program 1 times [2023-02-15 13:10:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:22,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263457556] [2023-02-15 13:10:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:22,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:22,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:22,902 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:22,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-15 13:10:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:22,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 13:10:22,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:22,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:23,041 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-15 13:10:23,125 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 11 [2023-02-15 13:10:23,152 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-15 13:10:23,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:23,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:23,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263457556] [2023-02-15 13:10:23,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263457556] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:23,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:23,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:10:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778436885] [2023-02-15 13:10:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:23,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:10:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:10:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:10:23,153 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-15 13:10:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:23,556 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2023-02-15 13:10:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:10:23,557 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-15 13:10:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:23,558 INFO L225 Difference]: With dead ends: 99 [2023-02-15 13:10:23,558 INFO L226 Difference]: Without dead ends: 99 [2023-02-15 13:10:23,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:10:23,558 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-15 13:10:23,559 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-15 13:10:23,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-15 13:10:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2023-02-15 13:10:23,561 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-15 13:10:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2023-02-15 13:10:23,561 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 30 [2023-02-15 13:10:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:23,562 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2023-02-15 13:10:23,562 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-15 13:10:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2023-02-15 13:10:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:10:23,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:23,563 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-15 13:10:23,577 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-15 13:10:23,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:23,775 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-15 13:10:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1978491108, now seen corresponding path program 1 times [2023-02-15 13:10:23,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:23,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378267909] [2023-02-15 13:10:23,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:23,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:23,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:23,777 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:23,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-15 13:10:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:23,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:10:23,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:23,902 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-15 13:10:23,909 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-15 13:10:23,940 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-15 13:10:23,943 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-15 13:10:23,959 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-15 13:10:23,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:23,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:23,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378267909] [2023-02-15 13:10:23,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378267909] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:23,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:23,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:23,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527758714] [2023-02-15 13:10:23,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:23,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:10:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:23,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:10:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:10:23,961 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-15 13:10:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:24,056 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-15 13:10:24,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:10:24,057 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-15 13:10:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:24,057 INFO L225 Difference]: With dead ends: 113 [2023-02-15 13:10:24,057 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 13:10:24,057 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-15 13:10:24,058 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 29 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 356 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-15 13:10:24,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 356 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:10:24,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 13:10:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 90. [2023-02-15 13:10:24,060 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-15 13:10:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-15 13:10:24,061 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 30 [2023-02-15 13:10:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:24,061 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-15 13:10:24,061 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-15 13:10:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-15 13:10:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:10:24,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:24,062 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-15 13:10:24,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:24,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:24,271 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-15 13:10:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:24,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1615411610, now seen corresponding path program 1 times [2023-02-15 13:10:24,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:24,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429326480] [2023-02-15 13:10:24,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:24,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:24,274 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:24,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-15 13:10:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:24,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:10:24,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:24,375 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-15 13:10:24,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:24,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:24,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429326480] [2023-02-15 13:10:24,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429326480] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:24,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:24,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:10:24,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378929478] [2023-02-15 13:10:24,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:24,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:10:24,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:10:24,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:10:24,382 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-15 13:10:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:24,418 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2023-02-15 13:10:24,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:10:24,418 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-15 13:10:24,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:24,419 INFO L225 Difference]: With dead ends: 96 [2023-02-15 13:10:24,419 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 13:10:24,419 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-15 13:10:24,420 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 48 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:24,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 172 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:10:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 13:10:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2023-02-15 13:10:24,422 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-15 13:10:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-02-15 13:10:24,422 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 30 [2023-02-15 13:10:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:24,422 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-02-15 13:10:24,422 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-15 13:10:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-02-15 13:10:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:10:24,423 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:24,423 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-15 13:10:24,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:24,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:24,630 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-15 13:10:24,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1204444567, now seen corresponding path program 1 times [2023-02-15 13:10:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:24,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175618871] [2023-02-15 13:10:24,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:24,632 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:24,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-15 13:10:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:24,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:10:24,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:24,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:24,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:24,892 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 5 [2023-02-15 13:10:24,918 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-15 13:10:24,965 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2023-02-15 13:10:24,966 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 25 treesize of output 39 [2023-02-15 13:10:24,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:24,983 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 25 treesize of output 24 [2023-02-15 13:10:25,090 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 11 [2023-02-15 13:10:25,118 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-15 13:10:25,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:33,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:33,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175618871] [2023-02-15 13:10:33,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175618871] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:33,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [734526612] [2023-02-15 13:10:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:33,161 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:10:33,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:10:33,162 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-15 13:10:33,163 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-15 13:10:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:33,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 13:10:33,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:33,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:33,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:33,396 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 5 [2023-02-15 13:10:33,405 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-15 13:10:33,429 INFO L321 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2023-02-15 13:10:33,430 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 20 treesize of output 26 [2023-02-15 13:10:33,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:33,468 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 25 treesize of output 24 [2023-02-15 13:10:33,544 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 11 [2023-02-15 13:10:33,551 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-15 13:10:33,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:42,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [734526612] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:42,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:10:42,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2023-02-15 13:10:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560687603] [2023-02-15 13:10:42,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:10:42,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 13:10:42,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:42,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 13:10:42,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=171, Unknown=4, NotChecked=54, Total=272 [2023-02-15 13:10:42,043 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-15 13:10:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:44,729 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2023-02-15 13:10:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:10:44,729 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-15 13:10:44,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:44,730 INFO L225 Difference]: With dead ends: 84 [2023-02-15 13:10:44,730 INFO L226 Difference]: Without dead ends: 84 [2023-02-15 13:10:44,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=88, Invalid=295, Unknown=5, NotChecked=74, Total=462 [2023-02-15 13:10:44,730 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 72 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:44,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 260 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 239 Invalid, 0 Unknown, 142 Unchecked, 0.4s Time] [2023-02-15 13:10:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-15 13:10:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-15 13:10:44,732 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-15 13:10:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2023-02-15 13:10:44,733 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 30 [2023-02-15 13:10:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:44,733 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2023-02-15 13:10:44,733 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-15 13:10:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2023-02-15 13:10:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:10:44,734 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:44,734 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-15 13:10:44,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:44,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-02-15 13:10:45,134 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-15 13:10:45,135 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-15 13:10:45,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -584147051, now seen corresponding path program 1 times [2023-02-15 13:10:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:45,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980443149] [2023-02-15 13:10:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:45,137 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-15 13:10:45,137 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-15 13:10:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:45,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:10:45,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:45,273 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-15 13:10:45,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:45,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:45,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980443149] [2023-02-15 13:10:45,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980443149] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:45,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:45,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372523739] [2023-02-15 13:10:45,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:45,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:10:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:45,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:10:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:10:45,275 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-15 13:10:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:45,345 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2023-02-15 13:10:45,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:10:45,346 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-15 13:10:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:45,346 INFO L225 Difference]: With dead ends: 91 [2023-02-15 13:10:45,346 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 13:10:45,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:10:45,347 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:45,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 270 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:10:45,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 13:10:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2023-02-15 13:10:45,349 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-15 13:10:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2023-02-15 13:10:45,350 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 30 [2023-02-15 13:10:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:45,350 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2023-02-15 13:10:45,350 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-15 13:10:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2023-02-15 13:10:45,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:10:45,351 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:45,351 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-15 13:10:45,359 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 (34)] Ended with exit code 0 [2023-02-15 13:10:45,556 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-15 13:10:45,557 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-15 13:10:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:45,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1451440213, now seen corresponding path program 1 times [2023-02-15 13:10:45,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:45,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [345799154] [2023-02-15 13:10:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:45,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:45,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:45,559 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-15 13:10:45,560 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-15 13:10:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:45,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 13:10:45,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:45,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:45,760 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:10:45,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:10:45,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:10:47,913 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|) (_ bv4 32)) |v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_21|))) is different from true [2023-02-15 13:10:47,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:47,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:47,985 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-15 13:10:48,152 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-15 13:10:48,202 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 14 treesize of output 20 [2023-02-15 13:10:48,299 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-15 13:10:48,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:10:48,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:10:48,656 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 66 treesize of output 72 [2023-02-15 13:10:48,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:48,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [345799154] [2023-02-15 13:10:48,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [345799154] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:10:48,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1863755425] [2023-02-15 13:10:48,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:10:48,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:10:48,877 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-15 13:10:48,878 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-15 13:10:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:49,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:10:49,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:49,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:49,557 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 14 treesize of output 20 [2023-02-15 13:10:49,800 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-15 13:10:49,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:49,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1863755425] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:49,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:10:49,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2023-02-15 13:10:49,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947318672] [2023-02-15 13:10:49,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:49,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:10:49,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:49,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:10:49,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=633, Unknown=1, NotChecked=50, Total=756 [2023-02-15 13:10:49,801 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-15 13:10:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:50,815 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2023-02-15 13:10:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:10:50,816 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-15 13:10:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:50,817 INFO L225 Difference]: With dead ends: 97 [2023-02-15 13:10:50,817 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 13:10:50,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=139, Invalid=1054, Unknown=1, NotChecked=66, Total=1260 [2023-02-15 13:10:50,817 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 123 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:50,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 175 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:10:50,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 13:10:50,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2023-02-15 13:10:50,820 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-15 13:10:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2023-02-15 13:10:50,820 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 33 [2023-02-15 13:10:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:50,821 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2023-02-15 13:10:50,821 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-15 13:10:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2023-02-15 13:10:50,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:10:50,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:50,821 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-15 13:10:50,830 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 (35)] Ended with exit code 0 [2023-02-15 13:10:51,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2023-02-15 13:10:51,229 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-15 13:10:51,229 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-15 13:10:51,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:51,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1451440214, now seen corresponding path program 1 times [2023-02-15 13:10:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:51,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073349648] [2023-02-15 13:10:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:51,231 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-15 13:10:51,231 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-15 13:10:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:51,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 13:10:51,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:51,591 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-15 13:10:51,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:51,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:51,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073349648] [2023-02-15 13:10:51,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073349648] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:51,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:51,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:10:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425136295] [2023-02-15 13:10:51,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:51,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:10:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:10:51,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:10:51,593 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-15 13:10:51,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:51,977 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2023-02-15 13:10:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:10:51,978 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-15 13:10:51,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:51,978 INFO L225 Difference]: With dead ends: 93 [2023-02-15 13:10:51,978 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 13:10:51,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:10:51,979 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-15 13:10:51,979 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-15 13:10:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 13:10:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-02-15 13:10:51,982 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-15 13:10:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2023-02-15 13:10:51,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 33 [2023-02-15 13:10:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:51,982 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2023-02-15 13:10:51,983 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-15 13:10:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2023-02-15 13:10:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:10:51,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:51,983 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-15 13:10:51,990 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-15 13:10:52,184 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-15 13:10:52,185 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-15 13:10:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1801348875, now seen corresponding path program 1 times [2023-02-15 13:10:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:52,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439727824] [2023-02-15 13:10:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:52,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:52,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:52,187 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-15 13:10:52,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 (38)] Waiting until timeout for monitored process [2023-02-15 13:10:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:52,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:10:52,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:52,412 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:10:52,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 13:10:52,453 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-15 13:10:52,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 13:11:00,682 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_unsafe_19_~a#1.offset_BEFORE_CALL_34| (_ BitVec 32)) (|v_ULTIMATE.start_probe_unsafe_19_~a#1.base_BEFORE_CALL_31| (_ BitVec 32))) (not (= |v_ULTIMATE.start_probe_unsafe_19_~a#1.base_BEFORE_CALL_31| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_probe_unsafe_19_~a#1.base_BEFORE_CALL_31|) |v_ULTIMATE.start_probe_unsafe_19_~a#1.offset_BEFORE_CALL_34|))))) is different from true [2023-02-15 13:11:00,704 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:11:00,704 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 27 treesize of output 27 [2023-02-15 13:11:00,709 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 14 treesize of output 20 [2023-02-15 13:11:00,720 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-15 13:11:00,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:00,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:00,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439727824] [2023-02-15 13:11:00,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439727824] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:00,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:00,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:11:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006338494] [2023-02-15 13:11:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:00,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:11:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:11:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=82, Unknown=2, NotChecked=18, Total=132 [2023-02-15 13:11:00,721 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-15 13:11:02,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:04,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:06,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:08,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:10,810 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-15 13:11:15,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:17,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:19,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:21,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:23,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:25,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:27,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:29,131 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-15 13:11:31,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:33,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:33,183 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2023-02-15 13:11:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:11:33,185 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-15 13:11:33,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:33,186 INFO L225 Difference]: With dead ends: 88 [2023-02-15 13:11:33,186 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 13:11:33,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=48, Invalid=136, Unknown=2, NotChecked=24, Total=210 [2023-02-15 13:11:33,187 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 48 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 5 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:33,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 180 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 160 Invalid, 15 Unknown, 77 Unchecked, 30.4s Time] [2023-02-15 13:11:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 13:11:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 13:11:33,189 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-15 13:11:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2023-02-15 13:11:33,189 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 33 [2023-02-15 13:11:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:33,190 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2023-02-15 13:11:33,190 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-15 13:11:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2023-02-15 13:11:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:11:33,190 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:33,190 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-15 13:11:33,202 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-15 13:11:33,390 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-15 13:11:33,391 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-15 13:11:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1801348876, now seen corresponding path program 1 times [2023-02-15 13:11:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:33,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590267136] [2023-02-15 13:11:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:33,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:33,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:33,392 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-15 13:11:33,394 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-15 13:11:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:33,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:11:33,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:33,591 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-15 13:11:33,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:33,612 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 14 treesize of output 16 [2023-02-15 13:11:33,624 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:11:33,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:11:33,749 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-15 13:11:33,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:33,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:33,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590267136] [2023-02-15 13:11:33,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590267136] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:33,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:33,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:11:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953996726] [2023-02-15 13:11:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:33,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:11:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:33,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:11:33,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=27, Unknown=1, NotChecked=10, Total=56 [2023-02-15 13:11:33,751 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-15 13:11:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:33,982 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2023-02-15 13:11:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:11:33,982 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-15 13:11:33,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:33,983 INFO L225 Difference]: With dead ends: 87 [2023-02-15 13:11:33,983 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 13:11:33,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2023-02-15 13:11:33,984 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:33,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 90 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 68 Unchecked, 0.2s Time] [2023-02-15 13:11:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 13:11:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-02-15 13:11:33,986 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-15 13:11:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2023-02-15 13:11:33,986 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 33 [2023-02-15 13:11:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:33,986 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2023-02-15 13:11:33,987 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-15 13:11:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2023-02-15 13:11:33,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 13:11:33,987 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:33,987 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-15 13:11:33,995 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 (39)] Ended with exit code 0 [2023-02-15 13:11:34,193 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-15 13:11:34,193 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-15 13:11:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1275833015, now seen corresponding path program 1 times [2023-02-15 13:11:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:34,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866731926] [2023-02-15 13:11:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:34,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:34,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:34,195 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-15 13:11:34,196 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-15 13:11:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:34,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 13:11:34,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:34,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:11:34,591 INFO L321 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2023-02-15 13:11:34,591 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 36 treesize of output 33 [2023-02-15 13:11:34,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:34,638 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-15 13:11:34,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 13:11:43,846 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| (_ BitVec 32)) (v_ArrVal_726 (_ BitVec 1)) (|v_ULTIMATE.start_probe_unsafe_19_#t~mem46#1.base_14| (_ BitVec 32))) (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_unsafe_19_#t~mem46#1.base_14|) (_ bv0 1)) (= |c_#valid| (store (store .cse0 |v_ULTIMATE.start_probe_unsafe_19_#t~mem46#1.base_14| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_7|))))) is different from true [2023-02-15 13:11:43,857 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-15 13:11:43,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:11:46,560 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_unsafe_19_~a#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_probe_unsafe_19_~a#1.offset|)) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~#a19~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-15 13:11:46,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:46,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866731926] [2023-02-15 13:11:46,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866731926] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:11:46,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1944707620] [2023-02-15 13:11:46,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:46,580 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:11:46,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:11:46,581 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-15 13:11:46,583 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-15 13:11:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:46,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 13:11:46,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:46,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:46,834 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-15 13:11:47,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:11:47,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:47,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:47,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:47,477 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 13:11:47,478 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 20 treesize of output 10 [2023-02-15 13:11:57,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:57,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:11:57,871 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:11:57,871 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 57 treesize of output 47 [2023-02-15 13:12:02,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:12:02,448 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 47 treesize of output 35 [2023-02-15 13:12:05,483 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-15 13:12:05,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:12:05,541 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_756 (_ 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_756)) |c_ULTIMATE.start_probe_unsafe_19_~a#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_probe_unsafe_19_~a#1.offset|)) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~#a19~0#1.base| (_ bv0 1)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-02-15 13:12:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1944707620] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:12:05,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:12:05,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 23 [2023-02-15 13:12:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280721476] [2023-02-15 13:12:05,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:12:05,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 13:12:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:12:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 13:12:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=12, NotChecked=156, Total=870 [2023-02-15 13:12:05,572 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-15 13:12:07,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:11,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:13,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:15,572 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-15 13:12:26,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:36,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:45,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:50,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:57,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:12:59,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:06,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:08,137 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-15 13:13:10,161 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-15 13:13:12,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:14,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:16,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:18,448 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-15 13:13:20,596 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-15 13:13:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:20,603 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2023-02-15 13:13:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:13:20,603 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-15 13:13:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:20,604 INFO L225 Difference]: With dead ends: 90 [2023-02-15 13:13:20,604 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 13:13:20,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=207, Invalid=1346, Unknown=19, NotChecked=234, Total=1806 [2023-02-15 13:13:20,605 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 106 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 26 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 38.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:20,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 407 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 438 Invalid, 17 Unknown, 73 Unchecked, 38.8s Time] [2023-02-15 13:13:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 13:13:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-15 13:13:20,606 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-15 13:13:20,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2023-02-15 13:13:20,607 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 32 [2023-02-15 13:13:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:20,607 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2023-02-15 13:13:20,607 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-15 13:13:20,607 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2023-02-15 13:13:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 13:13:20,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:20,608 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-15 13:13:20,615 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-15 13:13:20,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-02-15 13:13:21,009 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-15 13:13:21,009 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-15 13:13:21,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2044973706, now seen corresponding path program 1 times [2023-02-15 13:13:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:21,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911771934] [2023-02-15 13:13:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:21,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:21,011 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-15 13:13:21,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-02-15 13:13:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:21,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:13:21,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:21,215 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-15 13:13:21,330 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-15 13:13:21,357 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-15 13:13:21,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:21,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:13:21,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911771934] [2023-02-15 13:13:21,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911771934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:21,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:21,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:13:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335242125] [2023-02-15 13:13:21,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:21,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:13:21,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:13:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:13:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:13:21,359 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-15 13:13:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:21,777 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-02-15 13:13:21,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 13:13:21,778 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-15 13:13:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:21,778 INFO L225 Difference]: With dead ends: 75 [2023-02-15 13:13:21,779 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 13:13:21,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:13:21,779 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 95 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:21,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 250 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:21,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 13:13:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2023-02-15 13:13:21,781 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-15 13:13:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2023-02-15 13:13:21,782 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 34 [2023-02-15 13:13:21,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:21,782 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2023-02-15 13:13:21,782 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-15 13:13:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2023-02-15 13:13:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:13:21,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:21,783 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-15 13:13:21,790 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-15 13:13:21,983 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-15 13:13:21,984 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-15 13:13:21,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:21,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1030324427, now seen corresponding path program 1 times [2023-02-15 13:13:21,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:21,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337580135] [2023-02-15 13:13:21,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:21,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:21,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:21,986 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-15 13:13:21,989 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-15 13:13:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:22,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:13:22,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:22,472 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-15 13:13:22,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 15 treesize of output 7 [2023-02-15 13:13:23,054 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-15 13:13:23,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:23,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:13:23,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337580135] [2023-02-15 13:13:23,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337580135] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:23,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:23,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 13:13:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826162001] [2023-02-15 13:13:23,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:23,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:13:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:13:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:13:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:13:23,056 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-15 13:13:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:24,651 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2023-02-15 13:13:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 13:13:24,652 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-15 13:13:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:24,653 INFO L225 Difference]: With dead ends: 74 [2023-02-15 13:13:24,653 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 13:13:24,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:13:24,654 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 111 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:24,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 188 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:13:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 13:13:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2023-02-15 13:13:24,656 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-15 13:13:24,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2023-02-15 13:13:24,656 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 35 [2023-02-15 13:13:24,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:24,657 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2023-02-15 13:13:24,657 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-15 13:13:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2023-02-15 13:13:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:13:24,657 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:24,657 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-15 13:13:24,670 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-15 13:13:24,867 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-15 13:13:24,867 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-15 13:13:24,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:24,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1875286036, now seen corresponding path program 1 times [2023-02-15 13:13:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:24,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295447035] [2023-02-15 13:13:24,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:24,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:24,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:24,869 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-15 13:13:24,870 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-15 13:13:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:24,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 13:13:24,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:24,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:13:25,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:13:25,147 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 5 [2023-02-15 13:13:25,224 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2023-02-15 13:13:25,224 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 25 treesize of output 39 [2023-02-15 13:13:25,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:25,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-02-15 13:13:25,684 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 37 treesize of output 35 [2023-02-15 13:13:25,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:25,866 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 15 [2023-02-15 13:13:25,910 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-15 13:13:25,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:25,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:13:25,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295447035] [2023-02-15 13:13:25,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295447035] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:25,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:25,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 13:13:25,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758493952] [2023-02-15 13:13:25,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:25,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 13:13:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:13:25,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 13:13:25,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:13:25,912 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-15 13:13:27,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:27,622 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2023-02-15 13:13:27,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 13:13:27,622 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-15 13:13:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:27,623 INFO L225 Difference]: With dead ends: 73 [2023-02-15 13:13:27,623 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 13:13:27,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:13:27,624 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 67 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:27,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 298 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:13:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 13:13:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-02-15 13:13:27,626 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-15 13:13:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2023-02-15 13:13:27,626 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 36 [2023-02-15 13:13:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:27,626 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2023-02-15 13:13:27,626 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-15 13:13:27,627 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2023-02-15 13:13:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:13:27,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:27,627 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-15 13:13:27,639 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-15 13:13:27,827 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-15 13:13:27,828 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-15 13:13:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1632002513, now seen corresponding path program 1 times [2023-02-15 13:13:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:27,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760755261] [2023-02-15 13:13:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:27,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:27,830 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-15 13:13:27,835 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-15 13:13:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:27,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 13:13:27,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:27,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:13:28,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:13:28,128 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 5 [2023-02-15 13:13:28,219 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2023-02-15 13:13:28,219 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 25 treesize of output 39 [2023-02-15 13:13:28,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:28,274 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 35 treesize of output 28 [2023-02-15 13:13:28,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-02-15 13:13:28,683 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 24 treesize of output 30 [2023-02-15 13:13:28,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:28,748 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 15 [2023-02-15 13:13:28,793 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-15 13:13:28,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:28,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:13:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760755261] [2023-02-15 13:13:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760755261] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [563102675] [2023-02-15 13:13:28,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:28,986 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:13:28,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:13:28,987 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-15 13:13:28,988 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-15 13:13:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:29,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:13:29,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:29,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:13:29,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:13:29,225 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 5 [2023-02-15 13:13:29,296 INFO L321 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2023-02-15 13:13:29,297 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 25 treesize of output 39 [2023-02-15 13:13:29,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:29,313 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 35 treesize of output 28 [2023-02-15 13:13:29,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-02-15 13:13:29,561 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 24 treesize of output 30 [2023-02-15 13:13:29,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:29,610 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 15 [2023-02-15 13:13:29,618 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-15 13:13:29,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:29,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [563102675] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:29,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:13:29,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2023-02-15 13:13:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990121846] [2023-02-15 13:13:29,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:29,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:13:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:13:29,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:13:29,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=241, Unknown=9, NotChecked=0, Total=306 [2023-02-15 13:13:29,770 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-15 13:13:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:30,603 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2023-02-15 13:13:30,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:13:30,603 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-15 13:13:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:30,604 INFO L225 Difference]: With dead ends: 72 [2023-02-15 13:13:30,604 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 13:13:30,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=438, Unknown=13, NotChecked=0, Total=552 [2023-02-15 13:13:30,606 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 60 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:30,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 195 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 36 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:13:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 13:13:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-02-15 13:13:30,609 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-15 13:13:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2023-02-15 13:13:30,611 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 36 [2023-02-15 13:13:30,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:30,611 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2023-02-15 13:13:30,611 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-15 13:13:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2023-02-15 13:13:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:13:30,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:30,612 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-15 13:13:30,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:30,824 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-15 13:13:31,022 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-15 13:13:31,022 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-15 13:13:31,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:31,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1333538260, now seen corresponding path program 1 times [2023-02-15 13:13:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:31,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802668822] [2023-02-15 13:13:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:31,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:31,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:31,024 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-15 13:13:31,025 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-15 13:13:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:31,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:13:31,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:31,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:13:31,214 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:13:31,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:13:31,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:13:33,351 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_32| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_32|) (_ bv4 32)) |v_ULTIMATE.start_f19_~a#1.base_BEFORE_CALL_32|))) is different from true [2023-02-15 13:13:33,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:33,402 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-15 13:13:35,457 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~#a19~0#1.base_BEFORE_CALL_36| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~#a19~0#1.base_BEFORE_CALL_36| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_BEFORE_CALL_36|) (_ bv4 32))))) is different from true [2023-02-15 13:13:35,895 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-15 13:13:35,940 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 14 treesize of output 20 [2023-02-15 13:13:35,987 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-15 13:13:35,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:36,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:36,068 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 27 treesize of output 33 [2023-02-15 13:13:36,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:13:36,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802668822] [2023-02-15 13:13:36,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1802668822] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:36,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1268158851] [2023-02-15 13:13:36,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:36,295 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 13:13:36,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 13:13:36,296 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 13:13:36,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2023-02-15 13:13:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:36,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 13:13:36,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:36,672 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 9 treesize of output 3 [2023-02-15 13:13:36,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:36,842 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 14 treesize of output 20 [2023-02-15 13:13:37,018 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-15 13:13:37,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:37,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1268158851] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:37,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:13:37,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2023-02-15 13:13:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857738939] [2023-02-15 13:13:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:37,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:37,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:13:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=294, Unknown=2, NotChecked=70, Total=420 [2023-02-15 13:13:37,019 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:13:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:37,613 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2023-02-15 13:13:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:13:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-15 13:13:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:37,614 INFO L225 Difference]: With dead ends: 72 [2023-02-15 13:13:37,614 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 13:13:37,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=90, Invalid=422, Unknown=2, NotChecked=86, Total=600 [2023-02-15 13:13:37,614 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 53 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:37,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 127 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:13:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 13:13:37,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2023-02-15 13:13:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 58 states have (on average 1.0862068965517242) 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-15 13:13:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2023-02-15 13:13:37,617 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 40 [2023-02-15 13:13:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:37,617 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2023-02-15 13:13:37,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:13:37,617 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2023-02-15 13:13:37,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:13:37,617 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:37,617 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-15 13:13:37,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:37,825 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 (47)] Ended with exit code 0 [2023-02-15 13:13:38,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-15 13:13:38,018 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-15 13:13:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash 221296187, now seen corresponding path program 1 times [2023-02-15 13:13:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:38,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117939808] [2023-02-15 13:13:38,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:38,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:38,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:38,020 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-15 13:13:38,022 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-15 13:13:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:38,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 13:13:38,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:38,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:13:38,471 INFO L321 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2023-02-15 13:13:38,471 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 36 treesize of output 33 [2023-02-15 13:13:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:38,620 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-15 13:13:39,246 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:13:39,246 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 124 treesize of output 120 [2023-02-15 13:13:39,484 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 66 treesize of output 38 [2023-02-15 13:13:44,408 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_124 (_ BitVec 32)) (v_arrayElimCell_123 (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| (_ BitVec 32)) (v_ArrVal_964 (_ BitVec 1)) (v_ArrVal_955 (_ BitVec 1)) (v_ArrVal_954 (_ BitVec 1))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| v_ArrVal_954))) (let ((.cse0 (store .cse1 v_arrayElimCell_124 v_ArrVal_955))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9|) (_ bv0 1)) (= (select .cse0 v_arrayElimCell_123) (_ bv0 1)) (= (store (store (store (store .cse0 v_arrayElimCell_123 v_ArrVal_964) v_arrayElimCell_124 (_ bv0 1)) v_arrayElimCell_123 (_ bv0 1)) |v_ULTIMATE.start_entry_point_~#a19~0#1.base_9| (_ bv0 1)) |c_#valid|) (= (select .cse1 v_arrayElimCell_124) (_ bv0 1)))))) is different from true [2023-02-15 13:13:44,431 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-15 13:13:44,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:44,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:13:44,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117939808] [2023-02-15 13:13:44,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117939808] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:44,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:44,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-15 13:13:44,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822994405] [2023-02-15 13:13:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:44,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:13:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:13:44,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:13:44,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=236, Unknown=3, NotChecked=30, Total=306 [2023-02-15 13:13:44,433 INFO L87 Difference]: Start difference. First operand 71 states and 73 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-15 13:13:46,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:50,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:52,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:55,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:13:57,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:57,748 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2023-02-15 13:13:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:13:57,749 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-15 13:13:57,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:57,749 INFO L225 Difference]: With dead ends: 75 [2023-02-15 13:13:57,749 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 13:13:57,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=85, Invalid=565, Unknown=4, NotChecked=48, Total=702 [2023-02-15 13:13:57,750 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 7 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:57,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 309 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 428 Invalid, 5 Unknown, 70 Unchecked, 9.4s Time] [2023-02-15 13:13:57,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 13:13:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-15 13:13:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0851063829787233) internal successors, (51), 50 states have internal predecessors, (51), 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-15 13:13:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2023-02-15 13:13:57,752 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 42 [2023-02-15 13:13:57,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:57,752 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2023-02-15 13:13:57,753 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-15 13:13:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2023-02-15 13:13:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:13:57,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:57,753 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-15 13:13:57,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:57,963 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-15 13:13:57,963 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-15 13:13:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:57,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1630446902, now seen corresponding path program 1 times [2023-02-15 13:13:57,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:57,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456363858] [2023-02-15 13:13:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:57,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:57,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:57,965 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:13:57,968 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 (50)] Waiting until timeout for monitored process [2023-02-15 13:13:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:58,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:13:58,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:58,126 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-15 13:13:58,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:58,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:13:58,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456363858] [2023-02-15 13:13:58,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456363858] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:58,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:58,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:13:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957553443] [2023-02-15 13:13:58,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:58,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:13:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:13:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:13:58,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:13:58,127 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-15 13:13:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:58,198 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2023-02-15 13:13:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:13:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 42 [2023-02-15 13:13:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:58,199 INFO L225 Difference]: With dead ends: 59 [2023-02-15 13:13:58,199 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 13:13:58,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:13:58,200 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:58,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 13:13:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-15 13:13:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 50 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-15 13:13:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 58 transitions. [2023-02-15 13:13:58,202 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 58 transitions. Word has length 42 [2023-02-15 13:13:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:58,202 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 58 transitions. [2023-02-15 13:13:58,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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-15 13:13:58,202 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 58 transitions. [2023-02-15 13:13:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:13:58,202 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:58,202 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, 1] [2023-02-15 13:13:58,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:58,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:58,403 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-02-15 13:13:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1009142570, now seen corresponding path program 1 times [2023-02-15 13:13:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:13:58,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504877634] [2023-02-15 13:13:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:58,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:58,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:13:58,405 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:13:58,407 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 (51)] Waiting until timeout for monitored process [2023-02-15 13:13:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:13:58,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 13:13:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 13:13:58,596 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 13:13:58,596 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 13:13:58,597 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (23 of 24 remaining) [2023-02-15 13:13:58,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2023-02-15 13:13:58,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-02-15 13:13:58,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-02-15 13:13:58,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-02-15 13:13:58,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (12 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (11 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (10 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-02-15 13:13:58,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (7 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (6 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f19_undoErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f19_undoErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f19_undoErr2ASSERT_VIOLATIONMEMORY_FREE (2 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f19_undoErr3ASSERT_VIOLATIONMEMORY_FREE (1 of 24 remaining) [2023-02-15 13:13:58,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location f19_undoErr4ASSERT_VIOLATIONMEMORY_FREE (0 of 24 remaining) [2023-02-15 13:13:58,611 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 (51)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:58,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:13:58,813 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, 1] [2023-02-15 13:13:58,817 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 13:13:58,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 01:13:58 BoogieIcfgContainer [2023-02-15 13:13:58,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 13:13:58,856 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 13:13:58,856 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 13:13:58,856 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 13:13:58,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:09:42" (3/4) ... [2023-02-15 13:13:58,857 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 13:13:58,913 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 13:13:58,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 13:13:58,914 INFO L158 Benchmark]: Toolchain (without parser) took 257322.06ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 36.9MB in the beginning and 26.4MB in the end (delta: 10.5MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2023-02-15 13:13:58,914 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 48.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:13:58,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.83ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 36.7MB in the beginning and 50.1MB in the end (delta: -13.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-02-15 13:13:58,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.58ms. Allocated memory is still 94.4MB. Free memory was 50.1MB in the beginning and 47.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 13:13:58,914 INFO L158 Benchmark]: Boogie Preprocessor took 41.82ms. Allocated memory is still 94.4MB. Free memory was 47.6MB in the beginning and 72.1MB in the end (delta: -24.5MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2023-02-15 13:13:58,915 INFO L158 Benchmark]: RCFGBuilder took 465.01ms. Allocated memory is still 94.4MB. Free memory was 71.6MB in the beginning and 53.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 13:13:58,915 INFO L158 Benchmark]: TraceAbstraction took 256055.17ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.7MB in the beginning and 29.6MB in the end (delta: 23.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2023-02-15 13:13:58,915 INFO L158 Benchmark]: Witness Printer took 57.99ms. Allocated memory is still 113.2MB. Free memory was 29.6MB in the beginning and 26.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 13:13:58,917 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 71.3MB. Free memory was 48.2MB in the beginning and 48.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.83ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 36.7MB in the beginning and 50.1MB in the end (delta: -13.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.58ms. Allocated memory is still 94.4MB. Free memory was 50.1MB in the beginning and 47.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.82ms. Allocated memory is still 94.4MB. Free memory was 47.6MB in the beginning and 72.1MB in the end (delta: -24.5MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * RCFGBuilder took 465.01ms. Allocated memory is still 94.4MB. Free memory was 71.6MB in the beginning and 53.2MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 256055.17ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.7MB in the beginning and 29.6MB in the end (delta: 23.2MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 57.99ms. Allocated memory is still 113.2MB. Free memory was 29.6MB in the beginning and 26.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 793]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L804] CALL entry_point() [L797] struct A19 a19; [L798] CALL, EXPR probe_unsafe_19(&a19) [L774] int ret = - -3; VAL [a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}, ret=3] [L775] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L775] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={2:0}, ret=3] [L775] a->q = (int *)ldv_malloc(sizeof(int)) VAL [a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={2:0}, ret=3] [L776] EXPR a->q VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}, ret=3] [L776] COND FALSE !(!a->q) [L777] CALL, EXPR f19(a) [L762] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L762] RET, EXPR ldv_malloc(sizeof(int)) VAL [a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={3:0}] [L762] a->p = (int *)ldv_malloc(sizeof(int)) VAL [a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(int))={3:0}] [L763] a->p VAL [a={-2147483647:0}, a={-2147483647:0}, a->p={3:0}, ldv_global_msg_list={1:0}] [L763] COND TRUE a->p [L764] return 0; VAL [\result=0, a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}] [L777] RET, EXPR f19(a) [L777] ret = f19(a) [L778] COND FALSE !(\read(ret)) [L781] CALL, EXPR g19() [L771] return __VERIFIER_nondet_int(); [L781] RET, EXPR g19() [L781] COND TRUE !g19() [L786] CALL f19_undo(a) VAL [a={-2147483647:0}, ldv_global_msg_list={1:0}] [L768] EXPR a->p VAL [a={-2147483647:0}, a={-2147483647:0}, a->p={3:0}, ldv_global_msg_list={1:0}] [L768] free(a->p) VAL [a={-2147483647:0}, a={-2147483647:0}, a->p={3:0}, ldv_global_msg_list={1:0}] [L768] free(a->p) VAL [a={-2147483647:0}, a={-2147483647:0}, a->p={3:0}, ldv_global_msg_list={1:0}] [L768] free(a->p) [L786] RET f19_undo(a) VAL [a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}, ret=0] [L788] EXPR a->q VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}, ret=0] [L788] free(a->q) VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}, ret=0] [L788] free(a->q) VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}, ret=0] [L788] free(a->q) [L790] return ret; VAL [\result=0, a={-2147483647:0}, a={-2147483647:0}, ldv_global_msg_list={1:0}, ret=0] [L798] RET, EXPR probe_unsafe_19(&a19) [L798] int ret = probe_unsafe_19(&a19); [L799] COND TRUE ret==0 [L800] CALL disconnect_19(&a19) [L793] EXPR a->q VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}] [L793] free(a->q) VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}] [L793] free(a->q) VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}] [L793] free(a->q) VAL [a={-2147483647:0}, a={-2147483647:0}, a->q={2:0}, ldv_global_msg_list={1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 70 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 256.0s, OverallIterations: 40, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 139.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 74 mSolverCounterUnknown, 3019 SdHoareTripleChecker+Valid, 89.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2981 mSDsluCounter, 8860 SdHoareTripleChecker+Invalid, 88.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1079 IncrementalHoareTripleChecker+Unchecked, 6787 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5446 IncrementalHoareTripleChecker+Invalid, 6919 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 2073 mSDtfsCounter, 5446 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1717 GetRequests, 1191 SyntacticMatches, 37 SemanticMatches, 489 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 139.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=14, InterpolantAutomatonStates: 397, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 39 MinimizatonAttempts, 505 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 101.4s InterpolantComputationTime, 1420 NumberOfCodeBlocks, 1420 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1328 ConstructedInterpolants, 252 QuantifiedInterpolants, 14555 SizeOfPredicates, 495 NumberOfNonLiveVariables, 6024 ConjunctsInSsa, 891 ConjunctsInUnsatCore, 49 InterpolantComputations, 31 PerfectInterpolantSequences, 134/176 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 RESULT: Ultimate proved your program to be incorrect! [2023-02-15 13:13:59,003 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)