./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 574ddb4e Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test11_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 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:29:56,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:29:56,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:29:56,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:29:56,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:29:56,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:29:56,748 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:29:56,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:29:56,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:29:56,755 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:29:56,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:29:56,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:29:56,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:29:56,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:29:56,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:29:56,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:29:56,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:29:56,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:29:56,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:29:56,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:29:56,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:29:56,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:29:56,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:29:56,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:29:56,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:29:56,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:29:56,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:29:56,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:29:56,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:29:56,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:29:56,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:29:56,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:29:56,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:29:56,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:29:56,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:29:56,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:29:56,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:29:56,784 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:29:56,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:29:56,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:29:56,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:29:56,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 08:29:56,822 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:29:56,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:29:56,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:29:56,823 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:29:56,824 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:29:56,824 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:29:56,824 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:29:56,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:29:56,825 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:29:56,825 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:29:56,825 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:29:56,826 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:29:56,826 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:29:56,826 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:29:56,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:29:56,826 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:29:56,826 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:29:56,826 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:29:56,827 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:29:56,827 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:29:56,827 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:29:56,827 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:29:56,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:29:56,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:29:56,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:29:56,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:29:56,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:29:56,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:29:56,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 08:29:56,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 08:29:56,828 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:29:56,828 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:29:56,828 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:29:56,829 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:29:56,829 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 -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2023-02-17 08:29:56,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:29:57,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:29:57,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:29:57,009 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:29:57,010 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:29:57,010 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-17 08:29:57,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:29:58,143 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:29:58,144 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-17 08:29:58,158 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81c107cf/df324900a9464d3b841b97707c7d75a4/FLAGba303e850 [2023-02-17 08:29:58,554 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81c107cf/df324900a9464d3b841b97707c7d75a4 [2023-02-17 08:29:58,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:29:58,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:29:58,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:29:58,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:29:58,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:29:58,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:29:58" (1/1) ... [2023-02-17 08:29:58,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577e32d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:58, skipping insertion in model container [2023-02-17 08:29:58,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:29:58" (1/1) ... [2023-02-17 08:29:58,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:29:58,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:29:58,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:29:58,868 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-17 08:29:58,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72ff13a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:29:58, skipping insertion in model container [2023-02-17 08:29:58,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:29:58,870 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-17 08:29:58,871 INFO L158 Benchmark]: Toolchain (without parser) took 313.83ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 108.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 08:29:58,871 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 08:29:58,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 108.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 08:29:58,874 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 161.5MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.37ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 108.5MB in the end (delta: 13.8MB). 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_test11_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 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 --- Real Ultimate output --- This is Ultimate 0.2.2-?-574ddb4 [2023-02-17 08:30:00,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 08:30:00,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 08:30:00,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 08:30:00,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 08:30:00,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 08:30:00,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 08:30:00,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 08:30:00,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 08:30:00,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 08:30:00,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 08:30:00,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 08:30:00,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 08:30:00,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 08:30:00,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 08:30:00,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 08:30:00,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 08:30:00,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 08:30:00,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 08:30:00,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 08:30:00,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 08:30:00,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 08:30:00,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 08:30:00,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 08:30:00,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 08:30:00,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 08:30:00,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 08:30:00,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 08:30:00,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 08:30:00,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 08:30:00,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 08:30:00,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 08:30:00,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 08:30:00,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 08:30:00,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 08:30:00,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 08:30:00,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 08:30:00,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 08:30:00,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 08:30:00,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 08:30:00,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 08:30:00,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-17 08:30:00,553 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 08:30:00,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 08:30:00,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 08:30:00,554 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 08:30:00,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 08:30:00,555 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 08:30:00,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 08:30:00,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 08:30:00,556 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 08:30:00,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 08:30:00,557 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 08:30:00,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 08:30:00,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 08:30:00,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 08:30:00,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 08:30:00,558 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 08:30:00,558 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 08:30:00,558 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 08:30:00,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 08:30:00,558 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 08:30:00,558 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 08:30:00,558 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 08:30:00,559 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 08:30:00,559 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 08:30:00,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 08:30:00,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 08:30:00,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 08:30:00,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:30:00,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 08:30:00,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 08:30:00,560 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 08:30:00,560 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 08:30:00,560 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 08:30:00,560 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 08:30:00,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 08:30:00,561 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 08:30:00,561 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 08:30:00,561 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 -> 9c492ba1908c68ae7fad42ab0faa06b28fe0f7f3fdd04d2f1af5f4f1b8416a55 [2023-02-17 08:30:00,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 08:30:00,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 08:30:00,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 08:30:00,838 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 08:30:00,838 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 08:30:00,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-17 08:30:01,919 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 08:30:02,191 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 08:30:02,192 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test11_2.i [2023-02-17 08:30:02,206 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1c6d4a9/74b529307d5f48359196618a5485685c/FLAG862ca0e2b [2023-02-17 08:30:02,219 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a1c6d4a9/74b529307d5f48359196618a5485685c [2023-02-17 08:30:02,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 08:30:02,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 08:30:02,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 08:30:02,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 08:30:02,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 08:30:02,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c0f11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02, skipping insertion in model container [2023-02-17 08:30:02,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 08:30:02,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:30:02,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:30:02,555 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-17 08:30:02,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 08:30:02,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:30:02,610 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 08:30:02,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 08:30:02,697 INFO L208 MainTranslator]: Completed translation [2023-02-17 08:30:02,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02 WrapperNode [2023-02-17 08:30:02,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 08:30:02,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 08:30:02,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 08:30:02,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 08:30:02,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,739 INFO L138 Inliner]: procedures = 169, calls = 87, calls flagged for inlining = 26, calls inlined = 8, statements flattened = 92 [2023-02-17 08:30:02,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 08:30:02,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 08:30:02,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 08:30:02,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 08:30:02,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,764 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 08:30:02,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 08:30:02,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 08:30:02,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 08:30:02,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (1/1) ... [2023-02-17 08:30:02,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 08:30:02,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 08:30:02,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 08:30:02,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 08:30:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-17 08:30:02,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-17 08:30:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2023-02-17 08:30:02,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2023-02-17 08:30:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 08:30:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 08:30:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 08:30:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 08:30:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 08:30:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 08:30:02,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 08:30:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 08:30:02,989 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 08:30:02,990 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 08:30:03,247 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 08:30:03,262 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 08:30:03,262 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 08:30:03,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:30:03 BoogieIcfgContainer [2023-02-17 08:30:03,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 08:30:03,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 08:30:03,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 08:30:03,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 08:30:03,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 08:30:02" (1/3) ... [2023-02-17 08:30:03,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397b46c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:30:03, skipping insertion in model container [2023-02-17 08:30:03,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 08:30:02" (2/3) ... [2023-02-17 08:30:03,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397b46c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 08:30:03, skipping insertion in model container [2023-02-17 08:30:03,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 08:30:03" (3/3) ... [2023-02-17 08:30:03,288 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test11_2.i [2023-02-17 08:30:03,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 08:30:03,299 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-02-17 08:30:03,338 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 08:30:03,345 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;@2101ba1c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 08:30:03,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-02-17 08:30:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 08:30:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 08:30:03,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:03,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:03,353 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1738627509, now seen corresponding path program 1 times [2023-02-17 08:30:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229115018] [2023-02-17 08:30:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:03,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:03,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:03,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:03,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 08:30:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:03,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:30:03,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:30:03,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:30:03,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:03,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229115018] [2023-02-17 08:30:03,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229115018] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:30:03,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:30:03,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:30:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147310038] [2023-02-17 08:30:03,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:30:03,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:30:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:30:03,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:03,530 INFO L87 Difference]: Start difference. First operand has 85 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:30:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:03,639 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2023-02-17 08:30:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:30:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2023-02-17 08:30:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:03,647 INFO L225 Difference]: With dead ends: 157 [2023-02-17 08:30:03,648 INFO L226 Difference]: Without dead ends: 153 [2023-02-17 08:30:03,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:03,652 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:03,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 350 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:30:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-17 08:30:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 87. [2023-02-17 08:30:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 77 states have internal predecessors, (83), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 08:30:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2023-02-17 08:30:03,700 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 11 [2023-02-17 08:30:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:03,700 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2023-02-17 08:30:03,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:30:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2023-02-17 08:30:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 08:30:03,702 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:03,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:03,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:03,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:03,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:03,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:03,906 INFO L85 PathProgramCache]: Analyzing trace with hash -851123828, now seen corresponding path program 1 times [2023-02-17 08:30:03,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:03,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155133909] [2023-02-17 08:30:03,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:03,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:03,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:03,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:03,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 08:30:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:04,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:30:04,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:30:04,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:30:04,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:04,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155133909] [2023-02-17 08:30:04,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155133909] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:30:04,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:30:04,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 08:30:04,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079518956] [2023-02-17 08:30:04,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:30:04,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 08:30:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 08:30:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:30:04,014 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:30:04,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:04,199 INFO L93 Difference]: Finished difference Result 153 states and 176 transitions. [2023-02-17 08:30:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 08:30:04,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2023-02-17 08:30:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:04,200 INFO L225 Difference]: With dead ends: 153 [2023-02-17 08:30:04,200 INFO L226 Difference]: Without dead ends: 151 [2023-02-17 08:30:04,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 08:30:04,201 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 66 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:04,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 300 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:30:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-17 08:30:04,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 83. [2023-02-17 08:30:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 08:30:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-02-17 08:30:04,208 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 11 [2023-02-17 08:30:04,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:04,208 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-02-17 08:30:04,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 08:30:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-02-17 08:30:04,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:30:04,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:04,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:04,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:04,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:04,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:04,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash -470294884, now seen corresponding path program 1 times [2023-02-17 08:30:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:04,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67113734] [2023-02-17 08:30:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:04,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:04,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:04,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:04,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 08:30:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:04,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:30:04,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:30:04,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:30:04,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:04,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67113734] [2023-02-17 08:30:04,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67113734] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:30:04,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:30:04,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:30:04,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704382526] [2023-02-17 08:30:04,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:30:04,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:30:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:30:04,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:04,506 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:30:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:04,579 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2023-02-17 08:30:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:30:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2023-02-17 08:30:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:04,582 INFO L225 Difference]: With dead ends: 150 [2023-02-17 08:30:04,582 INFO L226 Difference]: Without dead ends: 150 [2023-02-17 08:30:04,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:04,590 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 63 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:04,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 444 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:30:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-17 08:30:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 87. [2023-02-17 08:30:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.607843137254902) internal successors, (82), 77 states have internal predecessors, (82), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2023-02-17 08:30:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2023-02-17 08:30:04,601 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 17 [2023-02-17 08:30:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:04,601 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2023-02-17 08:30:04,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 08:30:04,602 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2023-02-17 08:30:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:30:04,602 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:04,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:04,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 (4)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:04,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:04,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash -470294895, now seen corresponding path program 1 times [2023-02-17 08:30:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:04,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275476945] [2023-02-17 08:30:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:04,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:04,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:04,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:04,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 08:30:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:04,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:30:04,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:04,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:04,916 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_12 (_ BitVec 1))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| v_ArrVal_12))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:30:04,925 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:04,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-17 08:30:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:30:04,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:30:05,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:05,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275476945] [2023-02-17 08:30:05,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275476945] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:30:05,020 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:05,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-17 08:30:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231035929] [2023-02-17 08:30:05,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:05,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:30:05,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:05,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:30:05,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-17 08:30:05,021 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:05,257 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2023-02-17 08:30:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:30:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 17 [2023-02-17 08:30:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:05,258 INFO L225 Difference]: With dead ends: 114 [2023-02-17 08:30:05,258 INFO L226 Difference]: Without dead ends: 114 [2023-02-17 08:30:05,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-17 08:30:05,259 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 70 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:05,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 222 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2023-02-17 08:30:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-17 08:30:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2023-02-17 08:30:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 85 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (12), 10 states have call predecessors, (12), 7 states have call successors, (12) [2023-02-17 08:30:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2023-02-17 08:30:05,263 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 17 [2023-02-17 08:30:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:05,263 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2023-02-17 08:30:05,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2023-02-17 08:30:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:30:05,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:05,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:05,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:05,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:05,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash -470294894, now seen corresponding path program 1 times [2023-02-17 08:30:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:05,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153210069] [2023-02-17 08:30:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:05,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:05,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:05,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:05,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 08:30:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:05,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:30:05,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:05,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:05,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:05,570 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_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-17 08:30:05,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:05,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:05,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:05,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:30:05,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:07,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:07,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153210069] [2023-02-17 08:30:07,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153210069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:07,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [260318555] [2023-02-17 08:30:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:07,670 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:30:07,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:30:07,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:30:07,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-17 08:30:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:07,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:30:07,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:07,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 5 [2023-02-17 08:30:07,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:07,776 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_33 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_33))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:30:07,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:07,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:07,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:07,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-17 08:30:07,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:07,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [260318555] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:07,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:07,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-17 08:30:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260814240] [2023-02-17 08:30:07,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:07,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:30:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:07,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:30:07,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=70, Unknown=3, NotChecked=34, Total=132 [2023-02-17 08:30:07,868 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:08,412 INFO L93 Difference]: Finished difference Result 211 states and 240 transitions. [2023-02-17 08:30:08,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:30:08,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 17 [2023-02-17 08:30:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:08,413 INFO L225 Difference]: With dead ends: 211 [2023-02-17 08:30:08,414 INFO L226 Difference]: Without dead ends: 211 [2023-02-17 08:30:08,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2023-02-17 08:30:08,414 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:08,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 491 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 527 Invalid, 0 Unknown, 428 Unchecked, 0.5s Time] [2023-02-17 08:30:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-17 08:30:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 141. [2023-02-17 08:30:08,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 99 states have (on average 1.6262626262626263) internal successors, (161), 123 states have internal predecessors, (161), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (20), 15 states have call predecessors, (20), 12 states have call successors, (20) [2023-02-17 08:30:08,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 193 transitions. [2023-02-17 08:30:08,420 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 193 transitions. Word has length 17 [2023-02-17 08:30:08,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:08,420 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 193 transitions. [2023-02-17 08:30:08,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:08,420 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 193 transitions. [2023-02-17 08:30:08,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 08:30:08,421 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:08,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:08,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:08,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-17 08:30:08,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:08,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -763697902, now seen corresponding path program 1 times [2023-02-17 08:30:08,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:08,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164617572] [2023-02-17 08:30:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:08,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:08,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:08,825 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:08,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 08:30:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:08,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:30:08,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:30:08,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:30:08,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:08,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164617572] [2023-02-17 08:30:08,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164617572] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:30:08,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:30:08,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:30:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093580693] [2023-02-17 08:30:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:30:08,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:30:08,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:30:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:08,875 INFO L87 Difference]: Start difference. First operand 141 states and 193 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:30:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:08,900 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2023-02-17 08:30:08,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:30:08,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-02-17 08:30:08,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:08,902 INFO L225 Difference]: With dead ends: 123 [2023-02-17 08:30:08,902 INFO L226 Difference]: Without dead ends: 121 [2023-02-17 08:30:08,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:08,903 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:08,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:30:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-17 08:30:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-02-17 08:30:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 84 states have (on average 1.619047619047619) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-17 08:30:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 158 transitions. [2023-02-17 08:30:08,916 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 158 transitions. Word has length 17 [2023-02-17 08:30:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:08,918 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 158 transitions. [2023-02-17 08:30:08,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 08:30:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 158 transitions. [2023-02-17 08:30:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-17 08:30:08,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:08,920 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:08,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:09,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:09,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:09,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:09,129 INFO L85 PathProgramCache]: Analyzing trace with hash -806735705, now seen corresponding path program 1 times [2023-02-17 08:30:09,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:09,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409457105] [2023-02-17 08:30:09,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:09,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:09,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:09,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:09,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-17 08:30:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:09,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 08:30:09,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:30:09,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:30:09,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:09,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409457105] [2023-02-17 08:30:09,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409457105] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:30:09,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:09,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-17 08:30:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478878606] [2023-02-17 08:30:09,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:09,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:30:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:09,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:30:09,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:30:09,244 INFO L87 Difference]: Start difference. First operand 121 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:30:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:09,384 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2023-02-17 08:30:09,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 08:30:09,385 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 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 18 [2023-02-17 08:30:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:09,386 INFO L225 Difference]: With dead ends: 124 [2023-02-17 08:30:09,386 INFO L226 Difference]: Without dead ends: 122 [2023-02-17 08:30:09,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-02-17 08:30:09,386 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 71 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:09,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 279 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 08:30:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-17 08:30:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-17 08:30:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 86 states have (on average 1.5813953488372092) internal successors, (136), 107 states have internal predecessors, (136), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-17 08:30:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2023-02-17 08:30:09,390 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 18 [2023-02-17 08:30:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:09,390 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2023-02-17 08:30:09,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:30:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2023-02-17 08:30:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 08:30:09,390 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:09,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:09,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:09,599 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1173731936, now seen corresponding path program 1 times [2023-02-17 08:30:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820741302] [2023-02-17 08:30:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:09,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:09,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:09,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 08:30:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:09,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 08:30:09,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:09,671 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_entry_point_~c11~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~c11~0#1.base|)))) is different from true [2023-02-17 08:30:09,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:30:09,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:09,700 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_18| (_ bv0 1))))) is different from false [2023-02-17 08:30:09,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:09,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820741302] [2023-02-17 08:30:09,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820741302] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:09,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [39605404] [2023-02-17 08:30:09,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:09,701 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:30:09,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:30:09,702 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:30:09,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-17 08:30:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:09,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 08:30:09,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:30:09,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:09,843 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21| (_ bv0 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_entry_point_#t~ret43#1.base_21|))))) is different from false [2023-02-17 08:30:09,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [39605404] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:09,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:09,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-17 08:30:09,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133353990] [2023-02-17 08:30:09,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:09,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 08:30:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:09,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 08:30:09,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=126, Unknown=3, NotChecked=72, Total=240 [2023-02-17 08:30:09,846 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:30:10,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:10,275 INFO L93 Difference]: Finished difference Result 177 states and 221 transitions. [2023-02-17 08:30:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-17 08:30:10,276 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), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-02-17 08:30:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:10,277 INFO L225 Difference]: With dead ends: 177 [2023-02-17 08:30:10,277 INFO L226 Difference]: Without dead ends: 172 [2023-02-17 08:30:10,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=276, Unknown=3, NotChecked=108, Total=462 [2023-02-17 08:30:10,278 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 186 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:10,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 436 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 391 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2023-02-17 08:30:10,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-17 08:30:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 117. [2023-02-17 08:30:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 81 states have (on average 1.6049382716049383) internal successors, (130), 103 states have internal predecessors, (130), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (13), 10 states have call predecessors, (13), 9 states have call successors, (13) [2023-02-17 08:30:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 152 transitions. [2023-02-17 08:30:10,282 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 152 transitions. Word has length 21 [2023-02-17 08:30:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:10,282 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 152 transitions. [2023-02-17 08:30:10,282 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), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-17 08:30:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 152 transitions. [2023-02-17 08:30:10,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:30:10,283 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:10,283 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:10,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-02-17 08:30:10,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:10,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:10,685 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:10,686 INFO L85 PathProgramCache]: Analyzing trace with hash -624729604, now seen corresponding path program 1 times [2023-02-17 08:30:10,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:10,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974872620] [2023-02-17 08:30:10,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:10,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:10,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:10,687 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:10,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-17 08:30:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:10,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 08:30:10,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:10,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:10,774 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-17 08:30:10,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:10,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:30:10,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-02-17 08:30:10,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:30:10,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:10,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974872620] [2023-02-17 08:30:10,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974872620] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:30:10,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:10,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2023-02-17 08:30:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473765931] [2023-02-17 08:30:10,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:10,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 08:30:10,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 08:30:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-02-17 08:30:10,826 INFO L87 Difference]: Start difference. First operand 117 states and 152 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:30:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:11,011 INFO L93 Difference]: Finished difference Result 144 states and 187 transitions. [2023-02-17 08:30:11,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:30:11,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-17 08:30:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:11,012 INFO L225 Difference]: With dead ends: 144 [2023-02-17 08:30:11,012 INFO L226 Difference]: Without dead ends: 144 [2023-02-17 08:30:11,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=41, Unknown=1, NotChecked=12, Total=72 [2023-02-17 08:30:11,013 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 58 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:11,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 253 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 213 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2023-02-17 08:30:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-17 08:30:11,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 130. [2023-02-17 08:30:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 93 states have (on average 1.5913978494623655) internal successors, (148), 113 states have internal predecessors, (148), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (15), 13 states have call predecessors, (15), 10 states have call successors, (15) [2023-02-17 08:30:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 173 transitions. [2023-02-17 08:30:11,016 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 173 transitions. Word has length 25 [2023-02-17 08:30:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:11,016 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 173 transitions. [2023-02-17 08:30:11,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 08:30:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 173 transitions. [2023-02-17 08:30:11,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:30:11,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:11,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:11,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:11,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:11,223 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:11,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash -624729603, now seen corresponding path program 1 times [2023-02-17 08:30:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:11,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217393846] [2023-02-17 08:30:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:11,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:11,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:11,225 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:11,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-17 08:30:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:11,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 08:30:11,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:11,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:11,327 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| |c_ldv_malloc_#in~size|))) is different from true [2023-02-17 08:30:11,344 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:11,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:30:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-17 08:30:11,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:11,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:11,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217393846] [2023-02-17 08:30:11,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217393846] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:11,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [90026882] [2023-02-17 08:30:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:11,430 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:30:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:30:11,431 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:30:11,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2023-02-17 08:30:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:11,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 08:30:11,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:11,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:11,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:11,583 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_102 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_102))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:30:11,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:11,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:11,597 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:11,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-17 08:30:11,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:13,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [90026882] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:13,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:13,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-02-17 08:30:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768493337] [2023-02-17 08:30:13,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:13,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:30:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:13,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:30:13,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=172, Unknown=3, NotChecked=54, Total=272 [2023-02-17 08:30:13,682 INFO L87 Difference]: Start difference. First operand 130 states and 173 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:30:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:14,211 INFO L93 Difference]: Finished difference Result 247 states and 318 transitions. [2023-02-17 08:30:14,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 08:30:14,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2023-02-17 08:30:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:14,212 INFO L225 Difference]: With dead ends: 247 [2023-02-17 08:30:14,212 INFO L226 Difference]: Without dead ends: 247 [2023-02-17 08:30:14,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=54, Invalid=223, Unknown=3, NotChecked=62, Total=342 [2023-02-17 08:30:14,213 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 137 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 352 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:14,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 789 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 571 Invalid, 0 Unknown, 352 Unchecked, 0.5s Time] [2023-02-17 08:30:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-02-17 08:30:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 184. [2023-02-17 08:30:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 161 states have internal predecessors, (225), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (23), 19 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-17 08:30:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 264 transitions. [2023-02-17 08:30:14,225 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 264 transitions. Word has length 25 [2023-02-17 08:30:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:14,225 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 264 transitions. [2023-02-17 08:30:14,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-17 08:30:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 264 transitions. [2023-02-17 08:30:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 08:30:14,226 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:14,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:14,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:14,435 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 (13)] Ended with exit code 0 [2023-02-17 08:30:14,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:14,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1130288229, now seen corresponding path program 1 times [2023-02-17 08:30:14,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:14,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819089512] [2023-02-17 08:30:14,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:14,631 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:14,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 08:30:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:14,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:30:14,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 08:30:14,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:30:14,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:14,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819089512] [2023-02-17 08:30:14,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819089512] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:30:14,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:30:14,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:30:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11054159] [2023-02-17 08:30:14,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:30:14,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:30:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:30:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:14,713 INFO L87 Difference]: Start difference. First operand 184 states and 264 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:14,734 INFO L93 Difference]: Finished difference Result 119 states and 151 transitions. [2023-02-17 08:30:14,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:30:14,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-02-17 08:30:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:14,736 INFO L225 Difference]: With dead ends: 119 [2023-02-17 08:30:14,736 INFO L226 Difference]: Without dead ends: 117 [2023-02-17 08:30:14,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:14,736 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:14,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:30:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-17 08:30:14,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2023-02-17 08:30:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 103 states have internal predecessors, (128), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:30:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2023-02-17 08:30:14,740 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 25 [2023-02-17 08:30:14,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:14,740 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2023-02-17 08:30:14,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2023-02-17 08:30:14,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 08:30:14,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:14,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:14,751 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-17 08:30:14,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:14,952 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2108218693, now seen corresponding path program 1 times [2023-02-17 08:30:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:14,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702574618] [2023-02-17 08:30:14,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:14,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:14,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:14,954 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:14,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-17 08:30:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:14,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 08:30:15,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 08:30:15,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:30:15,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:15,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702574618] [2023-02-17 08:30:15,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702574618] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:30:15,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:30:15,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:30:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321152285] [2023-02-17 08:30:15,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:30:15,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 08:30:15,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 08:30:15,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:15,011 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 08:30:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:15,043 INFO L93 Difference]: Finished difference Result 162 states and 193 transitions. [2023-02-17 08:30:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 08:30:15,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2023-02-17 08:30:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:15,044 INFO L225 Difference]: With dead ends: 162 [2023-02-17 08:30:15,044 INFO L226 Difference]: Without dead ends: 162 [2023-02-17 08:30:15,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 08:30:15,045 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 52 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:15,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 408 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 08:30:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-17 08:30:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 117. [2023-02-17 08:30:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 103 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:30:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2023-02-17 08:30:15,048 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 26 [2023-02-17 08:30:15,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:15,048 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2023-02-17 08:30:15,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 08:30:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2023-02-17 08:30:15,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 08:30:15,049 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:15,049 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:15,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:15,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:15,253 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:15,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1299244922, now seen corresponding path program 1 times [2023-02-17 08:30:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:15,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728224636] [2023-02-17 08:30:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:15,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:15,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:15,255 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:15,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-17 08:30:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:15,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 08:30:15,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 08:30:15,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 08:30:15,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:15,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728224636] [2023-02-17 08:30:15,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728224636] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 08:30:15,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:15,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-02-17 08:30:15,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371746599] [2023-02-17 08:30:15,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:15,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 08:30:15,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:15,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 08:30:15,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:30:15,387 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:30:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:15,578 INFO L93 Difference]: Finished difference Result 116 states and 145 transitions. [2023-02-17 08:30:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 08:30:15,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 26 [2023-02-17 08:30:15,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:15,579 INFO L225 Difference]: With dead ends: 116 [2023-02-17 08:30:15,579 INFO L226 Difference]: Without dead ends: 116 [2023-02-17 08:30:15,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-17 08:30:15,580 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 110 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:15,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 315 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 08:30:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-17 08:30:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-17 08:30:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 102 states have internal predecessors, (124), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:30:15,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2023-02-17 08:30:15,582 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 26 [2023-02-17 08:30:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:15,583 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2023-02-17 08:30:15,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:30:15,583 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2023-02-17 08:30:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:30:15,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:15,583 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:15,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:15,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:15,789 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash 930272189, now seen corresponding path program 1 times [2023-02-17 08:30:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:15,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162475553] [2023-02-17 08:30:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:15,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:15,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:15,791 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:15,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-17 08:30:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:15,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 08:30:15,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:15,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:15,873 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)))) is different from true [2023-02-17 08:30:15,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:15,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:30:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-17 08:30:15,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 08:30:15,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:15,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162475553] [2023-02-17 08:30:15,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162475553] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 08:30:15,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 08:30:15,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 08:30:15,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579339079] [2023-02-17 08:30:15,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 08:30:15,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 08:30:15,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 08:30:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-02-17 08:30:15,883 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:16,005 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2023-02-17 08:30:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 08:30:16,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2023-02-17 08:30:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:16,006 INFO L225 Difference]: With dead ends: 145 [2023-02-17 08:30:16,006 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 08:30:16,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-17 08:30:16,006 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 82 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:16,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 222 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 134 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2023-02-17 08:30:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 08:30:16,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2023-02-17 08:30:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 101 states have internal predecessors, (122), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:30:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 143 transitions. [2023-02-17 08:30:16,009 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 143 transitions. Word has length 27 [2023-02-17 08:30:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:16,009 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 143 transitions. [2023-02-17 08:30:16,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 08:30:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2023-02-17 08:30:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-17 08:30:16,009 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:16,009 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:16,018 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 (18)] Ended with exit code 0 [2023-02-17 08:30:16,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:16,216 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:16,217 INFO L85 PathProgramCache]: Analyzing trace with hash 930272190, now seen corresponding path program 1 times [2023-02-17 08:30:16,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:16,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387727308] [2023-02-17 08:30:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:16,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:16,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:16,218 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:16,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-17 08:30:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:16,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 08:30:16,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:16,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:16,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:16,325 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_178 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_178))))) is different from true [2023-02-17 08:30:16,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:16,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:16,339 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:16,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:16,359 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_179 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_179))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:30:16,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:16,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:16,368 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:16,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2023-02-17 08:30:16,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:16,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:16,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387727308] [2023-02-17 08:30:16,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387727308] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:16,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1293737986] [2023-02-17 08:30:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:16,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:30:16,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:30:16,463 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:30:16,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-17 08:30:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:16,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-17 08:30:16,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:16,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:16,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:16,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:16,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 08:30:16,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:16,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:16,644 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_204 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_204))) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2023-02-17 08:30:16,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:16,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:16,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:16,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2023-02-17 08:30:16,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:18,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1293737986] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:18,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:18,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 13 [2023-02-17 08:30:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071560289] [2023-02-17 08:30:18,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:18,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 08:30:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 08:30:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=153, Unknown=3, NotChecked=78, Total=272 [2023-02-17 08:30:18,722 INFO L87 Difference]: Start difference. First operand 115 states and 143 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 08:30:19,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:19,536 INFO L93 Difference]: Finished difference Result 204 states and 224 transitions. [2023-02-17 08:30:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 08:30:19,537 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2023-02-17 08:30:19,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:19,538 INFO L225 Difference]: With dead ends: 204 [2023-02-17 08:30:19,538 INFO L226 Difference]: Without dead ends: 204 [2023-02-17 08:30:19,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=62, Invalid=253, Unknown=3, NotChecked=102, Total=420 [2023-02-17 08:30:19,538 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 151 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 22 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:19,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 962 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 747 Invalid, 11 Unknown, 393 Unchecked, 0.7s Time] [2023-02-17 08:30:19,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-17 08:30:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2023-02-17 08:30:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 100 states have internal predecessors, (120), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-17 08:30:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2023-02-17 08:30:19,541 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 27 [2023-02-17 08:30:19,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:19,541 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2023-02-17 08:30:19,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 08:30:19,541 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2023-02-17 08:30:19,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 08:30:19,541 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:19,541 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:19,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:19,751 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-17 08:30:19,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:19,944 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:19,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 638376382, now seen corresponding path program 1 times [2023-02-17 08:30:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:19,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97680720] [2023-02-17 08:30:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:19,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:19,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:19,946 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:19,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-17 08:30:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:20,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-17 08:30:20,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:20,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:20,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:20,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:20,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 39 [2023-02-17 08:30:20,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:20,115 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 46 [2023-02-17 08:30:20,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-17 08:30:20,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:20,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:20,273 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 65 treesize of output 69 [2023-02-17 08:30:20,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:20,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97680720] [2023-02-17 08:30:20,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97680720] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:20,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [252036045] [2023-02-17 08:30:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:20,332 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:30:20,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:30:20,333 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:30:20,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-17 08:30:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:20,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-17 08:30:20,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:20,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:20,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:20,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:20,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:22,643 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_18|))) is different from true [2023-02-17 08:30:22,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:22,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 43 [2023-02-17 08:30:22,700 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 35 treesize of output 25 [2023-02-17 08:30:22,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:22,773 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-17 08:30:22,776 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 13 treesize of output 9 [2023-02-17 08:30:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-17 08:30:22,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:22,780 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:22,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-02-17 08:30:22,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [252036045] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:22,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 08:30:22,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-02-17 08:30:22,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415897681] [2023-02-17 08:30:22,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 08:30:22,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 08:30:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 08:30:22,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 08:30:22,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=941, Unknown=14, NotChecked=62, Total=1122 [2023-02-17 08:30:22,838 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:30:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 08:30:30,467 INFO L93 Difference]: Finished difference Result 183 states and 215 transitions. [2023-02-17 08:30:30,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 08:30:30,467 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2023-02-17 08:30:30,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 08:30:30,468 INFO L225 Difference]: With dead ends: 183 [2023-02-17 08:30:30,468 INFO L226 Difference]: Without dead ends: 183 [2023-02-17 08:30:30,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=390, Invalid=2352, Unknown=18, NotChecked=102, Total=2862 [2023-02-17 08:30:30,469 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 410 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 08:30:30,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1417 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1338 Invalid, 0 Unknown, 162 Unchecked, 1.2s Time] [2023-02-17 08:30:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-17 08:30:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 88. [2023-02-17 08:30:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-17 08:30:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-17 08:30:30,472 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 29 [2023-02-17 08:30:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 08:30:30,472 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-17 08:30:30,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 08:30:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-17 08:30:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 08:30:30,473 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 08:30:30,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 08:30:30,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-17 08:30:30,682 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 (21)] Ended with exit code 0 [2023-02-17 08:30:30,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:30,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2023-02-17 08:30:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 08:30:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash 638376383, now seen corresponding path program 1 times [2023-02-17 08:30:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 08:30:30,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200623884] [2023-02-17 08:30:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:30,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 08:30:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 08:30:30,878 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 08:30:30,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 08:30:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:30,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-17 08:30:30,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:30,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:30,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:30,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 08:30:31,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:31,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:31,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:31,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 57 [2023-02-17 08:30:31,084 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 29 treesize of output 29 [2023-02-17 08:30:31,087 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 41 treesize of output 31 [2023-02-17 08:30:31,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:31,132 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2023-02-17 08:30:31,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-17 08:30:31,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-17 08:30:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 08:30:31,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 08:30:31,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:31,395 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 60 treesize of output 64 [2023-02-17 08:30:31,412 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_11) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) (.cse1 (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_prenex_12) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|))))) (and (or (and (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)))) .cse0 .cse1) (forall ((v_ArrVal_277 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_277) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) |c_ULTIMATE.start_entry_point_~cfg~1#1.base|))) (forall ((v_ArrVal_278 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_~cfg~1#1.base| v_ArrVal_278) |c_ULTIMATE.start_entry_point_~c11~0#1.base|) |c_ULTIMATE.start_entry_point_~c11~0#1.offset|) (_ bv4 32)) (bvadd |c_ULTIMATE.start_entry_point_~cfg~1#1.offset| (_ bv4 32)))) .cse0 .cse1)) is different from false [2023-02-17 08:30:31,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 08:30:31,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200623884] [2023-02-17 08:30:31,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200623884] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 08:30:31,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1656609076] [2023-02-17 08:30:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 08:30:31,425 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 08:30:31,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 08:30:31,436 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 08:30:31,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-17 08:30:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 08:30:31,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-17 08:30:31,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 08:30:31,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:31,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-17 08:30:33,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:33,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2023-02-17 08:30:33,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:33,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 08:30:33,884 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 37 treesize of output 27 [2023-02-17 08:30:33,888 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 9 treesize of output 3 [2023-02-17 08:30:33,937 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_304 (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_304)) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) (exists ((|v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22| (_ BitVec 32))) (and (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~c11~0#1.base_BEFORE_CALL_22|))))) is different from true [2023-02-17 08:30:33,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 08:30:33,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-17 08:30:33,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:33,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 38 [2023-02-17 08:30:34,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:34,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 84 [2023-02-17 08:30:34,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:34,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 54 [2023-02-17 08:30:34,034 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 6 treesize of output 4 [2023-02-17 08:30:34,060 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 182 treesize of output 154 [2023-02-17 08:30:34,063 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 42 treesize of output 32 [2023-02-17 08:30:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 1 [2023-02-17 08:30:34,072 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 43 treesize of output 31 [2023-02-17 08:30:34,075 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 34 treesize of output 24 [2023-02-17 08:30:34,078 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 46 treesize of output 34 [2023-02-17 08:30:34,090 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 43 treesize of output 31 [2023-02-17 08:30:34,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2023-02-17 08:30:34,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:34,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 34 select indices, 34 select index equivalence classes, 0 disjoint index pairs (out of 561 index pairs), introduced 43 new quantified variables, introduced 561 case distinctions, treesize of input 1342 treesize of output 5487 [2023-02-17 08:30:43,595 INFO L217 Elim1Store]: Index analysis took 8153 ms [2023-02-17 08:30:43,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 08:30:43,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 963 treesize of output 4577