./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/uthash-2.0.2/uthash_OAT_test4-3.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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:15:55,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:15:55,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:15:55,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:15:55,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:15:55,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:15:55,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:15:55,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:15:55,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:15:55,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:15:55,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:15:55,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:15:55,491 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:15:55,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:15:55,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:15:55,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:15:55,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:15:55,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:15:55,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:15:55,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:15:55,503 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:15:55,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:15:55,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:15:55,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:15:55,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:15:55,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:15:55,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:15:55,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:15:55,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:15:55,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:15:55,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:15:55,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:15:55,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:15:55,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:15:55,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:15:55,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:15:55,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:15:55,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:15:55,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:15:55,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:15:55,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:15:55,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:15:55,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 13:15:55,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:15:55,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:15:55,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:15:55,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:15:55,547 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:15:55,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:15:55,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:15:55,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:15:55,548 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:15:55,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:15:55,548 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:15:55,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:15:55,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:15:55,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:15:55,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:15:55,549 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 13:15:55,549 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 13:15:55,549 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 13:15:55,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:15:55,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 13:15:55,550 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:15:55,550 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:15:55,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:15:55,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:15:55,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:15:55,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:15:55,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:15:55,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:15:55,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:15:55,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:15:55,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2022-07-14 13:15:55,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:15:55,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:15:55,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:15:55,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:15:55,745 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:15:55,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-07-14 13:15:55,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dd5ed8e/13df8d35c8e341cabcd84350a38e1ec8/FLAG9ca871562 [2022-07-14 13:15:56,287 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:15:56,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-07-14 13:15:56,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dd5ed8e/13df8d35c8e341cabcd84350a38e1ec8/FLAG9ca871562 [2022-07-14 13:15:56,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61dd5ed8e/13df8d35c8e341cabcd84350a38e1ec8 [2022-07-14 13:15:56,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:15:56,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:15:56,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:15:56,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:15:56,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:15:56,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:15:56" (1/1) ... [2022-07-14 13:15:56,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@148babd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:15:56, skipping insertion in model container [2022-07-14 13:15:56,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:15:56" (1/1) ... [2022-07-14 13:15:56,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:15:56,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:15:57,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-07-14 13:15:57,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:15:57,227 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) [2022-07-14 13:15:57,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c20e6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:15:57, skipping insertion in model container [2022-07-14 13:15:57,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:15:57,228 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-14 13:15:57,229 INFO L158 Benchmark]: Toolchain (without parser) took 413.68ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 70.5MB in the end (delta: 5.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 13:15:57,230 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 109.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:15:57,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.13ms. Allocated memory is still 109.1MB. Free memory was 75.8MB in the beginning and 70.5MB in the end (delta: 5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 13:15:57,231 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.34ms. Allocated memory is still 109.1MB. Free memory is still 64.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.13ms. Allocated memory is still 109.1MB. Free memory was 75.8MB in the beginning and 70.5MB in the end (delta: 5.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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/uthash-2.0.2/uthash_OAT_test4-3.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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:15:58,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:15:58,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:15:58,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:15:58,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:15:58,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:15:58,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:15:58,716 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:15:58,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:15:58,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:15:58,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:15:58,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:15:58,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:15:58,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:15:58,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:15:58,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:15:58,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:15:58,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:15:58,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:15:58,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:15:58,745 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:15:58,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:15:58,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:15:58,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:15:58,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:15:58,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:15:58,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:15:58,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:15:58,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:15:58,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:15:58,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:15:58,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:15:58,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:15:58,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:15:58,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:15:58,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:15:58,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:15:58,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:15:58,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:15:58,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:15:58,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:15:58,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:15:58,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 13:15:58,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:15:58,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:15:58,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:15:58,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:15:58,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:15:58,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:15:58,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:15:58,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:15:58,785 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:15:58,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:15:58,785 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:15:58,786 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:15:58,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:15:58,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:15:58,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:15:58,786 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 13:15:58,786 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 13:15:58,786 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 13:15:58,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:15:58,787 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 13:15:58,787 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 13:15:58,787 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 13:15:58,787 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:15:58,787 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:15:58,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:15:58,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:15:58,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:15:58,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:15:58,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:15:58,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:15:58,788 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 13:15:58,788 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 13:15:58,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 13:15:58,789 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2022-07-14 13:15:59,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:15:59,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:15:59,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:15:59,075 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:15:59,076 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:15:59,077 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-07-14 13:15:59,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2e97fa8/d72097d64b254339aa3e2ae5fb7a0f93/FLAG2857d47e4 [2022-07-14 13:15:59,499 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:15:59,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2022-07-14 13:15:59,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2e97fa8/d72097d64b254339aa3e2ae5fb7a0f93/FLAG2857d47e4 [2022-07-14 13:15:59,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe2e97fa8/d72097d64b254339aa3e2ae5fb7a0f93 [2022-07-14 13:15:59,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:15:59,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:15:59,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:15:59,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:15:59,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:15:59,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:15:59" (1/1) ... [2022-07-14 13:15:59,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51254c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:15:59, skipping insertion in model container [2022-07-14 13:15:59,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:15:59" (1/1) ... [2022-07-14 13:15:59,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:15:59,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:16:00,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-07-14 13:16:00,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:16:00,279 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 13:16:00,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:16:00,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-07-14 13:16:00,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:16:00,389 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:16:00,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i[33021,33034] [2022-07-14 13:16:00,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:16:00,491 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:16:00,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00 WrapperNode [2022-07-14 13:16:00,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:16:00,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:16:00,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:16:00,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:16:00,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,594 INFO L137 Inliner]: procedures = 180, calls = 448, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1473 [2022-07-14 13:16:00,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:16:00,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:16:00,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:16:00,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:16:00,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:16:00,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:16:00,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:16:00,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:16:00,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (1/1) ... [2022-07-14 13:16:00,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:16:00,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:16:00,717 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) [2022-07-14 13:16:00,723 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 [2022-07-14 13:16:00,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 13:16:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 13:16:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 13:16:00,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 13:16:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 13:16:00,743 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 13:16:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 13:16:00,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:16:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 13:16:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 13:16:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 13:16:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 13:16:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 13:16:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 13:16:00,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:16:00,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:16:00,928 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:16:00,929 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:16:00,931 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 13:16:04,678 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:16:04,703 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:16:04,703 INFO L299 CfgBuilder]: Removed 77 assume(true) statements. [2022-07-14 13:16:04,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:16:04 BoogieIcfgContainer [2022-07-14 13:16:04,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:16:04,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:16:04,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:16:04,709 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:16:04,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:15:59" (1/3) ... [2022-07-14 13:16:04,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d5cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:16:04, skipping insertion in model container [2022-07-14 13:16:04,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:16:00" (2/3) ... [2022-07-14 13:16:04,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d5cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:16:04, skipping insertion in model container [2022-07-14 13:16:04,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:16:04" (3/3) ... [2022-07-14 13:16:04,711 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-3.i [2022-07-14 13:16:04,720 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:16:04,720 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2022-07-14 13:16:04,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:16:04,762 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d7b1dfb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@76bb664b [2022-07-14 13:16:04,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2022-07-14 13:16:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 13:16:04,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:04,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 13:16:04,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-14 13:16:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:04,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041661121] [2022-07-14 13:16:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:04,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:04,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:04,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:04,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 13:16:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:04,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 13:16:04,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:04,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:04,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:04,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:04,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041661121] [2022-07-14 13:16:04,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041661121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:04,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:04,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:16:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397711053] [2022-07-14 13:16:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:04,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 13:16:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:04,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 13:16:04,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 13:16:04,996 INFO L87 Difference]: Start difference. First operand has 1651 states, 787 states have (on average 2.283354510800508) internal successors, (1797), 1642 states have internal predecessors, (1797), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:05,056 INFO L93 Difference]: Finished difference Result 1633 states and 1726 transitions. [2022-07-14 13:16:05,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 13:16:05,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 13:16:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:05,079 INFO L225 Difference]: With dead ends: 1633 [2022-07-14 13:16:05,080 INFO L226 Difference]: Without dead ends: 1631 [2022-07-14 13:16:05,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 13:16:05,084 INFO L413 NwaCegarLoop]: 1726 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:05,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:16:05,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2022-07-14 13:16:05,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2022-07-14 13:16:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 778 states have (on average 2.1748071979434447) internal successors, (1692), 1622 states have internal predecessors, (1692), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 1724 transitions. [2022-07-14 13:16:05,153 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 1724 transitions. Word has length 5 [2022-07-14 13:16:05,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:05,154 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 1724 transitions. [2022-07-14 13:16:05,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 1724 transitions. [2022-07-14 13:16:05,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 13:16:05,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:05,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 13:16:05,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 13:16:05,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:05,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-14 13:16:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:05,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033871549] [2022-07-14 13:16:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:05,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:05,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:05,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 13:16:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:05,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:16:05,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:05,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:05,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:05,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033871549] [2022-07-14 13:16:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033871549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:05,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:05,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:16:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909119737] [2022-07-14 13:16:05,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:05,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:16:05,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:16:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:05,583 INFO L87 Difference]: Start difference. First operand 1631 states and 1724 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:07,398 INFO L93 Difference]: Finished difference Result 1668 states and 1774 transitions. [2022-07-14 13:16:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:16:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 13:16:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:07,402 INFO L225 Difference]: With dead ends: 1668 [2022-07-14 13:16:07,402 INFO L226 Difference]: Without dead ends: 1668 [2022-07-14 13:16:07,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:07,403 INFO L413 NwaCegarLoop]: 996 mSDtfsCounter, 1159 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:07,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1291 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 13:16:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2022-07-14 13:16:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1614. [2022-07-14 13:16:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 854 states have (on average 2.030444964871194) internal successors, (1734), 1605 states have internal predecessors, (1734), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1766 transitions. [2022-07-14 13:16:07,431 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 1766 transitions. Word has length 5 [2022-07-14 13:16:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:07,432 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 1766 transitions. [2022-07-14 13:16:07,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 1766 transitions. [2022-07-14 13:16:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 13:16:07,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:07,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 13:16:07,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:07,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:07,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-14 13:16:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33720743] [2022-07-14 13:16:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:07,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:07,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:07,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:07,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 13:16:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:07,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:16:07,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:07,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:07,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:07,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:07,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33720743] [2022-07-14 13:16:07,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33720743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:07,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:07,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:16:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345368827] [2022-07-14 13:16:07,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:07,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:16:07,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:16:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:07,787 INFO L87 Difference]: Start difference. First operand 1614 states and 1766 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:10,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:10,187 INFO L93 Difference]: Finished difference Result 1917 states and 2089 transitions. [2022-07-14 13:16:10,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:16:10,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 13:16:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:10,193 INFO L225 Difference]: With dead ends: 1917 [2022-07-14 13:16:10,193 INFO L226 Difference]: Without dead ends: 1917 [2022-07-14 13:16:10,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:10,194 INFO L413 NwaCegarLoop]: 1392 mSDtfsCounter, 504 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:10,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2076 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 13:16:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-07-14 13:16:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1770. [2022-07-14 13:16:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1020 states have (on average 2.0) internal successors, (2040), 1761 states have internal predecessors, (2040), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2072 transitions. [2022-07-14 13:16:10,237 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2072 transitions. Word has length 5 [2022-07-14 13:16:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:10,237 INFO L495 AbstractCegarLoop]: Abstraction has 1770 states and 2072 transitions. [2022-07-14 13:16:10,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2072 transitions. [2022-07-14 13:16:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 13:16:10,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:10,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 13:16:10,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:10,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:10,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1157601995, now seen corresponding path program 1 times [2022-07-14 13:16:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:10,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605209883] [2022-07-14 13:16:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:10,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:10,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:10,448 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:10,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 13:16:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:10,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 13:16:10,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:10,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:10,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:10,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605209883] [2022-07-14 13:16:10,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605209883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:10,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:10,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:16:10,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699266707] [2022-07-14 13:16:10,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:10,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:16:10,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:10,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:16:10,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:10,576 INFO L87 Difference]: Start difference. First operand 1770 states and 2072 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:10,638 INFO L93 Difference]: Finished difference Result 3114 states and 3679 transitions. [2022-07-14 13:16:10,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:16:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 13:16:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:10,651 INFO L225 Difference]: With dead ends: 3114 [2022-07-14 13:16:10,651 INFO L226 Difference]: Without dead ends: 3114 [2022-07-14 13:16:10,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:10,653 INFO L413 NwaCegarLoop]: 1900 mSDtfsCounter, 1143 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 3516 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:10,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 3516 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:16:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-14 13:16:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 1771. [2022-07-14 13:16:10,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1021 states have (on average 1.999020568070519) internal successors, (2041), 1762 states have internal predecessors, (2041), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2073 transitions. [2022-07-14 13:16:10,687 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2073 transitions. Word has length 6 [2022-07-14 13:16:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:10,689 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2073 transitions. [2022-07-14 13:16:10,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2073 transitions. [2022-07-14 13:16:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 13:16:10,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:10,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:10,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:10,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:10,901 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:10,902 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-14 13:16:10,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:10,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565893153] [2022-07-14 13:16:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:10,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:10,905 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:10,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 13:16:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:11,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 13:16:11,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:11,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:11,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:11,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565893153] [2022-07-14 13:16:11,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565893153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:11,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:11,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:16:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324221959] [2022-07-14 13:16:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:11,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:16:11,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:16:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:11,054 INFO L87 Difference]: Start difference. First operand 1771 states and 2073 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:11,080 INFO L93 Difference]: Finished difference Result 1735 states and 2036 transitions. [2022-07-14 13:16:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:16:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 13:16:11,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:11,106 INFO L225 Difference]: With dead ends: 1735 [2022-07-14 13:16:11,106 INFO L226 Difference]: Without dead ends: 1735 [2022-07-14 13:16:11,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:11,107 INFO L413 NwaCegarLoop]: 1573 mSDtfsCounter, 1533 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:11,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1606 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:16:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-14 13:16:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1729. [2022-07-14 13:16:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1003 states have (on average 1.992023928215354) internal successors, (1998), 1720 states have internal predecessors, (1998), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2030 transitions. [2022-07-14 13:16:11,131 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2030 transitions. Word has length 11 [2022-07-14 13:16:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:11,131 INFO L495 AbstractCegarLoop]: Abstraction has 1729 states and 2030 transitions. [2022-07-14 13:16:11,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:11,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2030 transitions. [2022-07-14 13:16:11,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 13:16:11,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:11,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:11,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-14 13:16:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:11,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:11,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:11,342 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-14 13:16:11,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:11,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893524909] [2022-07-14 13:16:11,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:11,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:11,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:11,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 13:16:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:11,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:16:11,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:11,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:11,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:11,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893524909] [2022-07-14 13:16:11,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893524909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:11,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:11,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:16:11,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243817956] [2022-07-14 13:16:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:11,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:16:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:16:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:16:11,494 INFO L87 Difference]: Start difference. First operand 1729 states and 2030 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:11,550 INFO L93 Difference]: Finished difference Result 1714 states and 2008 transitions. [2022-07-14 13:16:11,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:16:11,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 13:16:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:11,557 INFO L225 Difference]: With dead ends: 1714 [2022-07-14 13:16:11,557 INFO L226 Difference]: Without dead ends: 1714 [2022-07-14 13:16:11,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:16:11,558 INFO L413 NwaCegarLoop]: 1528 mSDtfsCounter, 1504 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:11,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 3082 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:16:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-07-14 13:16:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1707. [2022-07-14 13:16:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 995 states have (on average 1.9788944723618092) internal successors, (1969), 1698 states have internal predecessors, (1969), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2001 transitions. [2022-07-14 13:16:11,580 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2001 transitions. Word has length 13 [2022-07-14 13:16:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:11,580 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2001 transitions. [2022-07-14 13:16:11,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2001 transitions. [2022-07-14 13:16:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 13:16:11,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:11,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:11,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-14 13:16:11,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:11,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:11,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-14 13:16:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:11,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594637100] [2022-07-14 13:16:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:11,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:11,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:11,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:11,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 13:16:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:11,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:16:11,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:11,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:11,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:11,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:11,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594637100] [2022-07-14 13:16:11,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594637100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:11,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:11,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:16:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192272474] [2022-07-14 13:16:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:11,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:16:11,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:11,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:16:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:16:11,967 INFO L87 Difference]: Start difference. First operand 1707 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:14,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:14,546 INFO L93 Difference]: Finished difference Result 2520 states and 2820 transitions. [2022-07-14 13:16:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:16:14,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 13:16:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:14,552 INFO L225 Difference]: With dead ends: 2520 [2022-07-14 13:16:14,552 INFO L226 Difference]: Without dead ends: 2520 [2022-07-14 13:16:14,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:16:14,553 INFO L413 NwaCegarLoop]: 958 mSDtfsCounter, 2761 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:14,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 1876 Invalid, 1833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-14 13:16:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-07-14 13:16:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1703. [2022-07-14 13:16:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 995 states have (on average 1.9748743718592965) internal successors, (1965), 1694 states have internal predecessors, (1965), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1997 transitions. [2022-07-14 13:16:14,574 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1997 transitions. Word has length 27 [2022-07-14 13:16:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:14,574 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 1997 transitions. [2022-07-14 13:16:14,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1997 transitions. [2022-07-14 13:16:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 13:16:14,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:14,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:14,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:14,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:14,782 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:14,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-14 13:16:14,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:14,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092928146] [2022-07-14 13:16:14,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:14,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:14,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:14,784 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:14,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 13:16:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:14,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:16:14,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:14,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:15,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:15,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:15,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:15,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092928146] [2022-07-14 13:16:15,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092928146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:15,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:15,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:16:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055973349] [2022-07-14 13:16:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:15,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:16:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:15,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:16:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:16:15,031 INFO L87 Difference]: Start difference. First operand 1703 states and 1997 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:18,315 INFO L93 Difference]: Finished difference Result 2264 states and 2467 transitions. [2022-07-14 13:16:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:16:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 13:16:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:18,321 INFO L225 Difference]: With dead ends: 2264 [2022-07-14 13:16:18,321 INFO L226 Difference]: Without dead ends: 2264 [2022-07-14 13:16:18,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:16:18,321 INFO L413 NwaCegarLoop]: 1164 mSDtfsCounter, 1247 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:18,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2536 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 13:16:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-07-14 13:16:18,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1699. [2022-07-14 13:16:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 995 states have (on average 1.9708542713567838) internal successors, (1961), 1690 states have internal predecessors, (1961), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 1993 transitions. [2022-07-14 13:16:18,350 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 1993 transitions. Word has length 27 [2022-07-14 13:16:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:18,351 INFO L495 AbstractCegarLoop]: Abstraction has 1699 states and 1993 transitions. [2022-07-14 13:16:18,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 1993 transitions. [2022-07-14 13:16:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 13:16:18,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:18,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:18,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:18,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:18,563 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-14 13:16:18,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:18,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791315956] [2022-07-14 13:16:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:18,565 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:18,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 13:16:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:18,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:16:18,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:18,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:18,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791315956] [2022-07-14 13:16:18,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791315956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:18,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:18,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:16:18,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204299443] [2022-07-14 13:16:18,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:18,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:16:18,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:16:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:16:18,758 INFO L87 Difference]: Start difference. First operand 1699 states and 1993 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:18,794 INFO L93 Difference]: Finished difference Result 1699 states and 1989 transitions. [2022-07-14 13:16:18,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:16:18,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-14 13:16:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:18,798 INFO L225 Difference]: With dead ends: 1699 [2022-07-14 13:16:18,798 INFO L226 Difference]: Without dead ends: 1699 [2022-07-14 13:16:18,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:16:18,798 INFO L413 NwaCegarLoop]: 1522 mSDtfsCounter, 1480 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:18,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 3060 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:16:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2022-07-14 13:16:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1693. [2022-07-14 13:16:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 989 states have (on average 1.9726996966632964) internal successors, (1951), 1684 states have internal predecessors, (1951), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:18,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 1983 transitions. [2022-07-14 13:16:18,814 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 1983 transitions. Word has length 42 [2022-07-14 13:16:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:18,814 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 1983 transitions. [2022-07-14 13:16:18,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1983 transitions. [2022-07-14 13:16:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 13:16:18,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:18,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:18,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:19,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:19,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:19,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:19,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-14 13:16:19,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:19,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641454753] [2022-07-14 13:16:19,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:19,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:19,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:19,026 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:19,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 13:16:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:19,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:16:19,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:19,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:19,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:19,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641454753] [2022-07-14 13:16:19,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641454753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:19,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:19,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:16:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476037776] [2022-07-14 13:16:19,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:19,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:16:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:19,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:16:19,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:19,330 INFO L87 Difference]: Start difference. First operand 1693 states and 1983 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:19,457 INFO L93 Difference]: Finished difference Result 2112 states and 2419 transitions. [2022-07-14 13:16:19,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:16:19,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-14 13:16:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:19,469 INFO L225 Difference]: With dead ends: 2112 [2022-07-14 13:16:19,470 INFO L226 Difference]: Without dead ends: 2112 [2022-07-14 13:16:19,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:16:19,470 INFO L413 NwaCegarLoop]: 1600 mSDtfsCounter, 455 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:19,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 2996 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:16:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-07-14 13:16:19,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1739. [2022-07-14 13:16:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1035 states have (on average 1.9294685990338165) internal successors, (1997), 1730 states have internal predecessors, (1997), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2029 transitions. [2022-07-14 13:16:19,487 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2029 transitions. Word has length 50 [2022-07-14 13:16:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:19,487 INFO L495 AbstractCegarLoop]: Abstraction has 1739 states and 2029 transitions. [2022-07-14 13:16:19,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2029 transitions. [2022-07-14 13:16:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 13:16:19,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:19,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:19,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:19,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:19,697 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-14 13:16:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:19,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648491881] [2022-07-14 13:16:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:19,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:19,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:19,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 13:16:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:19,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:16:19,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:19,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:19,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:20,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 13:16:20,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:20,251 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 13:16:20,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-14 13:16:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:20,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:20,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:20,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648491881] [2022-07-14 13:16:20,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648491881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:20,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:20,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 13:16:20,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524162861] [2022-07-14 13:16:20,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:20,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:16:20,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:20,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:16:20,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:16:20,265 INFO L87 Difference]: Start difference. First operand 1739 states and 2029 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:22,499 INFO L93 Difference]: Finished difference Result 1708 states and 1952 transitions. [2022-07-14 13:16:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:16:22,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-14 13:16:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:22,504 INFO L225 Difference]: With dead ends: 1708 [2022-07-14 13:16:22,504 INFO L226 Difference]: Without dead ends: 1708 [2022-07-14 13:16:22,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:16:22,504 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 1095 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:22,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 1218 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 13:16:22,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2022-07-14 13:16:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1489. [2022-07-14 13:16:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 869 states have (on average 1.8365937859608745) internal successors, (1596), 1480 states have internal predecessors, (1596), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1628 transitions. [2022-07-14 13:16:22,517 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1628 transitions. Word has length 53 [2022-07-14 13:16:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:22,518 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1628 transitions. [2022-07-14 13:16:22,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1628 transitions. [2022-07-14 13:16:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 13:16:22,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:22,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:22,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:22,723 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:22,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-14 13:16:22,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:22,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271055595] [2022-07-14 13:16:22,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:22,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:22,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:22,726 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:22,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 13:16:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:22,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 13:16:22,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:22,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:22,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 13:16:22,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 13:16:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:22,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:22,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:22,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271055595] [2022-07-14 13:16:22,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271055595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:22,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:16:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039954849] [2022-07-14 13:16:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:22,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:16:22,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:16:22,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:16:22,979 INFO L87 Difference]: Start difference. First operand 1489 states and 1628 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:25,176 INFO L93 Difference]: Finished difference Result 1488 states and 1627 transitions. [2022-07-14 13:16:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 13:16:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 13:16:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:25,181 INFO L225 Difference]: With dead ends: 1488 [2022-07-14 13:16:25,181 INFO L226 Difference]: Without dead ends: 1488 [2022-07-14 13:16:25,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:16:25,181 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 4 mSDsluCounter, 2188 mSDsCounter, 0 mSdLazyCounter, 2143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:25,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3630 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2143 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 13:16:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-07-14 13:16:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-07-14 13:16:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 869 states have (on average 1.8354430379746836) internal successors, (1595), 1479 states have internal predecessors, (1595), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1627 transitions. [2022-07-14 13:16:25,195 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1627 transitions. Word has length 58 [2022-07-14 13:16:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:25,195 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 1627 transitions. [2022-07-14 13:16:25,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1627 transitions. [2022-07-14 13:16:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 13:16:25,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:25,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:25,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:25,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:25,417 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-14 13:16:25,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:25,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029263204] [2022-07-14 13:16:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:25,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:25,419 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:25,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 13:16:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:25,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 13:16:25,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:25,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:16:25,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 13:16:25,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 13:16:25,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 13:16:25,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 13:16:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:25,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:25,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:25,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029263204] [2022-07-14 13:16:25,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029263204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:25,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:25,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:16:25,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686545356] [2022-07-14 13:16:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:25,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:16:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:25,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:16:25,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:16:25,701 INFO L87 Difference]: Start difference. First operand 1488 states and 1627 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:28,633 INFO L93 Difference]: Finished difference Result 1487 states and 1626 transitions. [2022-07-14 13:16:28,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 13:16:28,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-14 13:16:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:28,636 INFO L225 Difference]: With dead ends: 1487 [2022-07-14 13:16:28,637 INFO L226 Difference]: Without dead ends: 1487 [2022-07-14 13:16:28,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 13:16:28,637 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 2 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:28,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3681 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 13:16:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-07-14 13:16:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487. [2022-07-14 13:16:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 868 states have (on average 1.836405529953917) internal successors, (1594), 1478 states have internal predecessors, (1594), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 13:16:28,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1626 transitions. [2022-07-14 13:16:28,650 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1626 transitions. Word has length 58 [2022-07-14 13:16:28,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:28,650 INFO L495 AbstractCegarLoop]: Abstraction has 1487 states and 1626 transitions. [2022-07-14 13:16:28,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:16:28,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1626 transitions. [2022-07-14 13:16:28,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 13:16:28,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:28,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:28,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:28,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:28,860 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:28,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1222950270, now seen corresponding path program 1 times [2022-07-14 13:16:28,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:28,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424768044] [2022-07-14 13:16:28,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:28,861 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:28,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:28,862 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:28,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 13:16:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:29,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 13:16:29,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:29,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:16:29,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:29,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424768044] [2022-07-14 13:16:29,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424768044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:16:29,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:16:29,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:16:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179653442] [2022-07-14 13:16:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:16:29,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 13:16:29,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 13:16:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 13:16:29,113 INFO L87 Difference]: Start difference. First operand 1487 states and 1626 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-14 13:16:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:29,157 INFO L93 Difference]: Finished difference Result 1490 states and 1631 transitions. [2022-07-14 13:16:29,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 13:16:29,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2022-07-14 13:16:29,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:29,162 INFO L225 Difference]: With dead ends: 1490 [2022-07-14 13:16:29,162 INFO L226 Difference]: Without dead ends: 1490 [2022-07-14 13:16:29,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:16:29,163 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 2 mSDsluCounter, 2874 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:29,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4315 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:16:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2022-07-14 13:16:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2022-07-14 13:16:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 870 states have (on average 1.835632183908046) internal successors, (1597), 1481 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 13:16:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1631 transitions. [2022-07-14 13:16:29,176 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1631 transitions. Word has length 66 [2022-07-14 13:16:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:29,176 INFO L495 AbstractCegarLoop]: Abstraction has 1490 states and 1631 transitions. [2022-07-14 13:16:29,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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) [2022-07-14 13:16:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1631 transitions. [2022-07-14 13:16:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 13:16:29,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:29,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:29,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:29,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:29,386 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -428715873, now seen corresponding path program 1 times [2022-07-14 13:16:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:29,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418523930] [2022-07-14 13:16:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:16:29,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:29,390 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:29,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 13:16:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:16:29,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:16:29,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:29,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:29,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:29,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418523930] [2022-07-14 13:16:29,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418523930] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:16:29,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:16:29,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-14 13:16:29,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866374924] [2022-07-14 13:16:29,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:16:29,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 13:16:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:29,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 13:16:29,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 13:16:29,693 INFO L87 Difference]: Start difference. First operand 1490 states and 1631 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:29,831 INFO L93 Difference]: Finished difference Result 1502 states and 1649 transitions. [2022-07-14 13:16:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 13:16:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-14 13:16:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:29,835 INFO L225 Difference]: With dead ends: 1502 [2022-07-14 13:16:29,835 INFO L226 Difference]: Without dead ends: 1502 [2022-07-14 13:16:29,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-14 13:16:29,835 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 15 mSDsluCounter, 5737 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 7178 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:29,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 7178 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:16:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-07-14 13:16:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1500. [2022-07-14 13:16:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 879 states have (on average 1.8339021615472126) internal successors, (1612), 1490 states have internal predecessors, (1612), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 13:16:29,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1646 transitions. [2022-07-14 13:16:29,855 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1646 transitions. Word has length 67 [2022-07-14 13:16:29,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:29,855 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 1646 transitions. [2022-07-14 13:16:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:29,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1646 transitions. [2022-07-14 13:16:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 13:16:29,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:29,856 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:29,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:30,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:30,064 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:30,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:30,065 INFO L85 PathProgramCache]: Analyzing trace with hash 155254206, now seen corresponding path program 2 times [2022-07-14 13:16:30,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:30,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685436386] [2022-07-14 13:16:30,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:16:30,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:30,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:30,066 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:30,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 13:16:30,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:16:30,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:16:30,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 13:16:30,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:30,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:30,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:30,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:30,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685436386] [2022-07-14 13:16:30,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685436386] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:16:30,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:16:30,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-14 13:16:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402605949] [2022-07-14 13:16:30,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:16:30,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 13:16:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 13:16:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:16:30,546 INFO L87 Difference]: Start difference. First operand 1500 states and 1646 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:31,026 INFO L93 Difference]: Finished difference Result 1521 states and 1678 transitions. [2022-07-14 13:16:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 13:16:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-14 13:16:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:31,030 INFO L225 Difference]: With dead ends: 1521 [2022-07-14 13:16:31,030 INFO L226 Difference]: Without dead ends: 1517 [2022-07-14 13:16:31,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-14 13:16:31,032 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 44 mSDsluCounter, 11498 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 12942 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:31,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 12942 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:16:31,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2022-07-14 13:16:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1509. [2022-07-14 13:16:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 888 states have (on average 1.8288288288288288) internal successors, (1624), 1499 states have internal predecessors, (1624), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 13:16:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1658 transitions. [2022-07-14 13:16:31,058 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1658 transitions. Word has length 70 [2022-07-14 13:16:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:31,058 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1658 transitions. [2022-07-14 13:16:31,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1658 transitions. [2022-07-14 13:16:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-14 13:16:31,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:31,061 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:31,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:31,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:31,271 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:31,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash -392207842, now seen corresponding path program 3 times [2022-07-14 13:16:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:31,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434112541] [2022-07-14 13:16:31,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:16:31,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:31,274 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:31,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 13:16:31,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 13:16:31,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:16:31,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 13:16:31,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:31,857 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:31,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:32,346 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:32,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434112541] [2022-07-14 13:16:32,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434112541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:16:32,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:16:32,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-14 13:16:32,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821443731] [2022-07-14 13:16:32,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:16:32,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-14 13:16:32,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:32,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-14 13:16:32,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-14 13:16:32,348 INFO L87 Difference]: Start difference. First operand 1509 states and 1658 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:34,792 INFO L93 Difference]: Finished difference Result 1551 states and 1734 transitions. [2022-07-14 13:16:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-14 13:16:34,792 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-14 13:16:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:34,794 INFO L225 Difference]: With dead ends: 1551 [2022-07-14 13:16:34,795 INFO L226 Difference]: Without dead ends: 1545 [2022-07-14 13:16:34,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 13:16:34,796 INFO L413 NwaCegarLoop]: 1448 mSDtfsCounter, 162 mSDsluCounter, 15872 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 17320 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:34,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 17320 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 13:16:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2022-07-14 13:16:34,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1527. [2022-07-14 13:16:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 906 states have (on average 1.8178807947019868) internal successors, (1647), 1517 states have internal predecessors, (1647), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 13:16:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1681 transitions. [2022-07-14 13:16:34,809 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1681 transitions. Word has length 76 [2022-07-14 13:16:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:34,809 INFO L495 AbstractCegarLoop]: Abstraction has 1527 states and 1681 transitions. [2022-07-14 13:16:34,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1681 transitions. [2022-07-14 13:16:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-14 13:16:34,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:34,810 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:34,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:35,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:35,028 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1896075998, now seen corresponding path program 4 times [2022-07-14 13:16:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:35,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177001143] [2022-07-14 13:16:35,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 13:16:35,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:35,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:35,030 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:35,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 13:16:35,302 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 13:16:35,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:16:35,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 13:16:35,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:35,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:16:36,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:36,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177001143] [2022-07-14 13:16:36,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177001143] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:16:36,794 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:16:36,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-14 13:16:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553793677] [2022-07-14 13:16:36,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:16:36,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 13:16:36,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:16:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 13:16:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-14 13:16:36,796 INFO L87 Difference]: Start difference. First operand 1527 states and 1681 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:45,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:16:45,894 INFO L93 Difference]: Finished difference Result 1607 states and 1814 transitions. [2022-07-14 13:16:45,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-14 13:16:45,894 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-14 13:16:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:16:45,897 INFO L225 Difference]: With dead ends: 1607 [2022-07-14 13:16:45,897 INFO L226 Difference]: Without dead ends: 1603 [2022-07-14 13:16:45,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-14 13:16:45,900 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 416 mSDsluCounter, 34926 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 36387 SdHoareTripleChecker+Invalid, 3510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 13:16:45,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 36387 Invalid, 3510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 13:16:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2022-07-14 13:16:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1561. [2022-07-14 13:16:45,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 940 states have (on average 1.8010638297872341) internal successors, (1693), 1551 states have internal predecessors, (1693), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-14 13:16:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1727 transitions. [2022-07-14 13:16:45,924 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1727 transitions. Word has length 88 [2022-07-14 13:16:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:16:45,924 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 1727 transitions. [2022-07-14 13:16:45,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 13:16:45,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1727 transitions. [2022-07-14 13:16:45,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 13:16:45,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:16:45,925 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:16:45,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 13:16:46,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 13:16:46,137 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:16:46,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:16:46,137 INFO L85 PathProgramCache]: Analyzing trace with hash 202285118, now seen corresponding path program 5 times [2022-07-14 13:16:46,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:16:46,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48038280] [2022-07-14 13:16:46,138 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 13:16:46,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:16:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:16:46,139 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:16:46,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 13:16:47,229 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 13:16:47,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:16:47,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 13:16:47,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:16:47,277 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 13:16:47,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 [2022-07-14 13:16:47,498 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 13:16:47,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-14 13:16:47,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 13:16:47,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2022-07-14 13:16:51,113 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (or (= (bvadd (bvneg v_arrayElimCell_9) (select |c_#valid| (_ bv0 32))) (_ bv0 1)) (= v_arrayElimCell_11 (_ bv0 32))) (= (_ bv1 1) (select |c_#valid| v_arrayElimCell_11)) (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ bv0 32))))) (exists ((v_ArrVal_1588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1588)))) is different from true [2022-07-14 13:16:53,199 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:16:53,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 51 [2022-07-14 13:16:53,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2022-07-14 13:16:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2022-07-14 13:16:53,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:16:53,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:16:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48038280] [2022-07-14 13:16:53,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48038280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:16:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802198642] [2022-07-14 13:16:53,727 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 13:16:53,727 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 13:16:53,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 13:16:53,729 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 13:16:53,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-14 13:18:11,735 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-14 13:18:11,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:18:11,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 13:18:11,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:18:11,951 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 13:18:11,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 [2022-07-14 13:18:12,109 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 13:18:12,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-14 13:18:12,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 13:18:12,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2022-07-14 13:18:14,345 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:18:14,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 [2022-07-14 13:18:14,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2022-07-14 13:18:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-14 13:18:14,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:18:14,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802198642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:18:14,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 13:18:14,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2022-07-14 13:18:14,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847978661] [2022-07-14 13:18:14,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 13:18:14,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:18:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 13:18:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:18:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=333, Unknown=27, NotChecked=38, Total=462 [2022-07-14 13:18:14,635 INFO L87 Difference]: Start difference. First operand 1561 states and 1727 transitions. Second operand has 19 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 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) [2022-07-14 13:18:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:18:17,795 INFO L93 Difference]: Finished difference Result 1628 states and 1797 transitions. [2022-07-14 13:18:17,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 13:18:17,795 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 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 110 [2022-07-14 13:18:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:18:17,798 INFO L225 Difference]: With dead ends: 1628 [2022-07-14 13:18:17,798 INFO L226 Difference]: Without dead ends: 1624 [2022-07-14 13:18:17,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 117 SyntacticMatches, 91 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=143, Invalid=630, Unknown=43, NotChecked=54, Total=870 [2022-07-14 13:18:17,799 INFO L413 NwaCegarLoop]: 1422 mSDtfsCounter, 75 mSDsluCounter, 7976 mSDsCounter, 0 mSdLazyCounter, 2899 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 9398 SdHoareTripleChecker+Invalid, 8862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5958 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-14 13:18:17,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 9398 Invalid, 8862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2899 Invalid, 0 Unknown, 5958 Unchecked, 2.8s Time] [2022-07-14 13:18:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-07-14 13:18:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1622. [2022-07-14 13:18:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 999 states have (on average 1.7557557557557557) internal successors, (1754), 1610 states have internal predecessors, (1754), 17 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (19), 8 states have call predecessors, (19), 17 states have call successors, (19) [2022-07-14 13:18:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1790 transitions. [2022-07-14 13:18:17,812 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1790 transitions. Word has length 110 [2022-07-14 13:18:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:18:17,813 INFO L495 AbstractCegarLoop]: Abstraction has 1622 states and 1790 transitions. [2022-07-14 13:18:17,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.375) internal successors, (134), 18 states have internal predecessors, (134), 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) [2022-07-14 13:18:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1790 transitions. [2022-07-14 13:18:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 13:18:17,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:18:17,814 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:18:17,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 13:18:18,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-14 13:18:18,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 13:18:18,228 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2022-07-14 13:18:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:18:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash 202285119, now seen corresponding path program 1 times [2022-07-14 13:18:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 13:18:18,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474216911] [2022-07-14 13:18:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:18:18,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 13:18:18,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 13:18:18,230 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 13:18:18,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 13:18:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:18:18,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-14 13:18:18,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:18:18,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 13:18:19,046 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 13:18:19,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-07-14 13:18:19,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 13:18:19,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 13:18:19,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 13:18:19,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-14 13:18:19,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-07-14 13:18:19,198 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2459 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2459) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2458 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2458)))) is different from true [2022-07-14 13:18:19,205 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:18:19,211 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2462 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2462))) (exists ((v_ArrVal_2463 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2463))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,224 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-07-14 13:18:19,248 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,255 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471)))) is different from true [2022-07-14 13:18:19,261 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473)))) is different from true [2022-07-14 13:18:19,267 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,277 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477)))) is different from true [2022-07-14 13:18:19,283 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-07-14 13:18:19,290 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,296 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,319 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,326 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,332 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,339 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,345 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,352 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:18:19,358 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499))) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,364 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-14 13:18:19,370 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-14 13:18:19,377 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,383 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:18:19,389 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2509) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,395 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2510)))) is different from true [2022-07-14 13:18:19,402 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513)))) is different from true [2022-07-14 13:18:19,408 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,415 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,421 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-14 13:18:19,427 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521)))) is different from true [2022-07-14 13:18:19,432 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,438 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:18:19,445 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-14 13:18:19,451 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-14 13:18:19,458 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2531 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2531))) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530)))) is different from true [2022-07-14 13:18:19,465 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,471 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-14 13:18:19,476 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536)))) is different from true [2022-07-14 13:18:19,482 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,488 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-14 13:18:19,494 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_24 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_24) (_ bv44 32)))) is different from true [2022-07-14 13:18:19,516 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 13:18:19,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2022-07-14 13:18:19,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-14 13:18:19,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 13:18:19,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 13:18:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 984 not checked. [2022-07-14 13:18:19,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:18:20,135 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32)))))) is different from false [2022-07-14 13:18:20,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 13:18:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474216911] [2022-07-14 13:18:20,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474216911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:18:20,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [151197230] [2022-07-14 13:18:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:18:20,141 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 13:18:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 13:18:20,142 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 13:18:20,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process