./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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_SAX_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 13:04:11,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:04:11,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:04:11,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:04:11,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:04:11,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:04:11,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:04:11,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:04:11,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:04:11,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:04:11,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:04:11,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:04:11,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:04:11,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:04:11,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:04:11,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:04:11,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:04:11,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:04:11,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:04:11,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:04:11,832 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:04:11,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:04:11,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:04:11,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:04:11,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:04:11,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:04:11,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:04:11,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:04:11,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:04:11,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:04:11,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:04:11,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:04:11,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:04:11,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:04:11,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:04:11,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:04:11,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:04:11,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:04:11,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:04:11,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:04:11,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:04:11,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:04:11,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 13:04:11,879 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:04:11,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:04:11,879 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:04:11,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:04:11,880 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:04:11,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:04:11,881 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:04:11,881 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:04:11,882 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:04:11,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:04:11,883 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 13:04:11,883 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:04:11,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:04:11,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 13:04:11,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:04:11,884 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 13:04:11,884 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 13:04:11,884 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 13:04:11,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:04:11,884 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 13:04:11,884 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 13:04:11,885 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:04:11,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:04:11,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:04:11,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:04:11,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:04:11,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:04:11,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:04:11,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 13:04:11,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 13:04:11,886 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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2022-07-23 13:04:12,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:04:12,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:04:12,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:04:12,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:04:12,153 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:04:12,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2022-07-23 13:04:12,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b29624b5/9fe4904433e541768d112c6ca0a99bc2/FLAGb0cddbf76 [2022-07-23 13:04:12,720 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:04:12,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2022-07-23 13:04:12,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b29624b5/9fe4904433e541768d112c6ca0a99bc2/FLAGb0cddbf76 [2022-07-23 13:04:13,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b29624b5/9fe4904433e541768d112c6ca0a99bc2 [2022-07-23 13:04:13,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:04:13,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:04:13,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:04:13,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:04:13,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:04:13,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:04:13" (1/1) ... [2022-07-23 13:04:13,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf381e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:13, skipping insertion in model container [2022-07-23 13:04:13,036 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:04:13" (1/1) ... [2022-07-23 13:04:13,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:04:13,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:04:13,440 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_SAX_test8-2.i[33021,33034] [2022-07-23 13:04:13,577 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_SAX_test8-2.i[45234,45247] [2022-07-23 13:04:13,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:04:13,618 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-23 13:04:13,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@34895053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:13, skipping insertion in model container [2022-07-23 13:04:13,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:04:13,621 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 13:04:13,623 INFO L158 Benchmark]: Toolchain (without parser) took 594.41ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 73.6MB in the end (delta: 77.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 13:04:13,624 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 43.8MB in the beginning and 43.8MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:04:13,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.47ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 73.6MB in the end (delta: -116.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 13:04:13,628 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.17ms. Allocated memory is still 88.1MB. Free memory was 43.8MB in the beginning and 43.8MB in the end (delta: 43.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.47ms. Allocated memory is still 109.1MB. Free memory was 73.4MB in the beginning and 73.6MB in the end (delta: -116.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_SAX_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 13:04:15,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:04:15,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:04:15,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:04:15,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:04:15,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:04:15,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:04:15,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:04:15,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:04:15,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:04:15,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:04:15,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:04:15,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:04:15,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:04:15,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:04:15,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:04:15,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:04:15,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:04:15,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:04:15,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:04:15,564 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:04:15,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:04:15,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:04:15,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:04:15,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:04:15,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:04:15,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:04:15,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:04:15,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:04:15,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:04:15,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:04:15,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:04:15,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:04:15,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:04:15,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:04:15,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:04:15,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:04:15,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:04:15,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:04:15,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:04:15,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:04:15,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:04:15,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 13:04:15,627 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:04:15,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:04:15,629 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:04:15,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:04:15,630 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:04:15,630 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:04:15,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:04:15,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:04:15,632 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:04:15,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:04:15,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 13:04:15,633 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:04:15,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:04:15,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 13:04:15,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:04:15,634 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 13:04:15,634 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 13:04:15,634 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 13:04:15,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:04:15,635 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 13:04:15,635 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 13:04:15,635 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 13:04:15,636 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 13:04:15,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:04:15,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:04:15,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:04:15,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:04:15,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:04:15,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:04:15,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:04:15,638 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 13:04:15,638 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 13:04:15,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 13:04:15,638 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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2022-07-23 13:04:15,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:04:15,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:04:15,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:04:15,999 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:04:16,000 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:04:16,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2022-07-23 13:04:16,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9406164/5a86604adedc4e83b78c698ad99c8fe8/FLAG7a845a9ea [2022-07-23 13:04:16,668 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:04:16,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2022-07-23 13:04:16,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9406164/5a86604adedc4e83b78c698ad99c8fe8/FLAG7a845a9ea [2022-07-23 13:04:17,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9406164/5a86604adedc4e83b78c698ad99c8fe8 [2022-07-23 13:04:17,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:04:17,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:04:17,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:04:17,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:04:17,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:04:17,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:17,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dbcbe09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17, skipping insertion in model container [2022-07-23 13:04:17,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:17,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:04:17,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:04:17,408 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_SAX_test8-2.i[33021,33034] [2022-07-23 13:04:17,511 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_SAX_test8-2.i[45234,45247] [2022-07-23 13:04:17,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:04:17,540 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 13:04:17,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:04:17,595 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_SAX_test8-2.i[33021,33034] [2022-07-23 13:04:17,654 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_SAX_test8-2.i[45234,45247] [2022-07-23 13:04:17,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:04:17,668 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 13:04:17,689 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_SAX_test8-2.i[33021,33034] [2022-07-23 13:04:17,743 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_SAX_test8-2.i[45234,45247] [2022-07-23 13:04:17,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:04:17,790 INFO L208 MainTranslator]: Completed translation [2022-07-23 13:04:17,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17 WrapperNode [2022-07-23 13:04:17,791 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:04:17,792 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 13:04:17,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 13:04:17,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 13:04:17,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:17,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:17,905 INFO L137 Inliner]: procedures = 180, calls = 348, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1175 [2022-07-23 13:04:17,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 13:04:17,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 13:04:17,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 13:04:17,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 13:04:17,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:17,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:17,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:17,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:18,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:18,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:18,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:18,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 13:04:18,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 13:04:18,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 13:04:18,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 13:04:18,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (1/1) ... [2022-07-23 13:04:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:04:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:04:18,097 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-23 13:04:18,120 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-23 13:04:18,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 13:04:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 13:04:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 13:04:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 13:04:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 13:04:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 13:04:18,137 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2022-07-23 13:04:18,137 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2022-07-23 13:04:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 13:04:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 13:04:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 13:04:18,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 13:04:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 13:04:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 13:04:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 13:04:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 13:04:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 13:04:18,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 13:04:18,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 13:04:18,456 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 13:04:18,458 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 13:04:18,461 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 13:04:22,463 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 13:04:22,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 13:04:22,490 INFO L299 CfgBuilder]: Removed 71 assume(true) statements. [2022-07-23 13:04:22,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:04:22 BoogieIcfgContainer [2022-07-23 13:04:22,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 13:04:22,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 13:04:22,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 13:04:22,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 13:04:22,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 01:04:17" (1/3) ... [2022-07-23 13:04:22,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e2689d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:04:22, skipping insertion in model container [2022-07-23 13:04:22,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:04:17" (2/3) ... [2022-07-23 13:04:22,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e2689d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:04:22, skipping insertion in model container [2022-07-23 13:04:22,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:04:22" (3/3) ... [2022-07-23 13:04:22,504 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-2.i [2022-07-23 13:04:22,518 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 13:04:22,518 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 641 error locations. [2022-07-23 13:04:22,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 13:04:22,602 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@2842beb1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b7e1f0a [2022-07-23 13:04:22,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 641 error locations. [2022-07-23 13:04:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 1296 states, 634 states have (on average 2.2539432176656153) internal successors, (1429), 1287 states have internal predecessors, (1429), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-23 13:04:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 13:04:22,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:22,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 13:04:22,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:22,624 INFO L85 PathProgramCache]: Analyzing trace with hash 132136, now seen corresponding path program 1 times [2022-07-23 13:04:22,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:22,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171249457] [2022-07-23 13:04:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:22,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:22,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:22,643 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-23 13:04:22,664 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-23 13:04:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:22,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:04:22,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:22,842 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-23 13:04:22,863 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-23 13:04:22,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:22,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:22,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171249457] [2022-07-23 13:04:22,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171249457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:22,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:22,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:04:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685702343] [2022-07-23 13:04:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:22,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:04:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:22,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:04:22,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:04:22,897 INFO L87 Difference]: Start difference. First operand has 1296 states, 634 states have (on average 2.2539432176656153) internal successors, (1429), 1287 states have internal predecessors, (1429), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-23 13:04:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:24,785 INFO L93 Difference]: Finished difference Result 1476 states and 1582 transitions. [2022-07-23 13:04:24,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:04:24,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-23 13:04:24,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:24,808 INFO L225 Difference]: With dead ends: 1476 [2022-07-23 13:04:24,808 INFO L226 Difference]: Without dead ends: 1474 [2022-07-23 13:04:24,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 13:04:24,813 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 1162 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:24,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 1048 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-23 13:04:24,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2022-07-23 13:04:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1285. [2022-07-23 13:04:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 637 states have (on average 2.111459968602826) internal successors, (1345), 1275 states have internal predecessors, (1345), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-23 13:04:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1387 transitions. [2022-07-23 13:04:24,917 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1387 transitions. Word has length 3 [2022-07-23 13:04:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:24,918 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1387 transitions. [2022-07-23 13:04:24,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-23 13:04:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1387 transitions. [2022-07-23 13:04:24,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 13:04:24,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:24,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 13:04:24,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 13:04:25,128 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-23 13:04:25,129 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:25,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash 132137, now seen corresponding path program 1 times [2022-07-23 13:04:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:25,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094924118] [2022-07-23 13:04:25,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:25,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:25,132 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-23 13:04:25,135 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-23 13:04:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:25,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:04:25,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:25,286 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-23 13:04:25,298 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-23 13:04:25,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:25,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:25,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094924118] [2022-07-23 13:04:25,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094924118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:25,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:25,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:04:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259860457] [2022-07-23 13:04:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:25,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:04:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:25,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:04:25,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:04:25,306 INFO L87 Difference]: Start difference. First operand 1285 states and 1387 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-23 13:04:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:28,394 INFO L93 Difference]: Finished difference Result 1877 states and 2020 transitions. [2022-07-23 13:04:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:04:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-23 13:04:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:28,402 INFO L225 Difference]: With dead ends: 1877 [2022-07-23 13:04:28,402 INFO L226 Difference]: Without dead ends: 1877 [2022-07-23 13:04:28,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 13:04:28,407 INFO L413 NwaCegarLoop]: 1090 mSDtfsCounter, 631 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1840 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:28,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1840 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-23 13:04:28,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2022-07-23 13:04:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1489. [2022-07-23 13:04:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 841 states have (on average 2.097502972651605) internal successors, (1764), 1478 states have internal predecessors, (1764), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-23 13:04:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1808 transitions. [2022-07-23 13:04:28,443 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1808 transitions. Word has length 3 [2022-07-23 13:04:28,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:28,443 INFO L495 AbstractCegarLoop]: Abstraction has 1489 states and 1808 transitions. [2022-07-23 13:04:28,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-23 13:04:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1808 transitions. [2022-07-23 13:04:28,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 13:04:28,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:28,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:28,455 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-23 13:04:28,655 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-23 13:04:28,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:28,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1773817970, now seen corresponding path program 1 times [2022-07-23 13:04:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:28,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328050066] [2022-07-23 13:04:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:28,659 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-23 13:04:28,667 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-23 13:04:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:28,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 13:04:28,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:28,824 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-23 13:04:28,830 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-23 13:04:28,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 13:04:28,894 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-23 13:04:28,907 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 13:04:28,908 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 12 treesize of output 12 [2022-07-23 13:04:28,931 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-23 13:04:28,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:28,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:28,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328050066] [2022-07-23 13:04:28,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328050066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:28,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:28,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:04:28,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970919178] [2022-07-23 13:04:28,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:28,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:28,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:28,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:28,936 INFO L87 Difference]: Start difference. First operand 1489 states and 1808 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-23 13:04:31,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:31,791 INFO L93 Difference]: Finished difference Result 1671 states and 1997 transitions. [2022-07-23 13:04:31,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:04:31,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-23 13:04:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:31,797 INFO L225 Difference]: With dead ends: 1671 [2022-07-23 13:04:31,798 INFO L226 Difference]: Without dead ends: 1671 [2022-07-23 13:04:31,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-23 13:04:31,799 INFO L413 NwaCegarLoop]: 490 mSDtfsCounter, 2605 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:31,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 645 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 13:04:31,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-07-23 13:04:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1274. [2022-07-23 13:04:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 637 states have (on average 2.0926216640502355) internal successors, (1333), 1264 states have internal predecessors, (1333), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-23 13:04:31,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1375 transitions. [2022-07-23 13:04:31,830 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1375 transitions. Word has length 7 [2022-07-23 13:04:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:31,831 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1375 transitions. [2022-07-23 13:04:31,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-23 13:04:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1375 transitions. [2022-07-23 13:04:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 13:04:31,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:31,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:31,843 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-23 13:04:32,042 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-23 13:04:32,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash -846217710, now seen corresponding path program 1 times [2022-07-23 13:04:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:32,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236229472] [2022-07-23 13:04:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:32,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:32,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:32,048 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-23 13:04:32,051 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-23 13:04:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:32,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:04:32,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:32,188 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-23 13:04:32,202 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-23 13:04:32,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:32,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:32,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236229472] [2022-07-23 13:04:32,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236229472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:32,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:32,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:04:32,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895978753] [2022-07-23 13:04:32,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:32,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:04:32,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:32,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:04:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:04:32,206 INFO L87 Difference]: Start difference. First operand 1274 states and 1375 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-23 13:04:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:34,007 INFO L93 Difference]: Finished difference Result 1601 states and 1729 transitions. [2022-07-23 13:04:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:04:34,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-23 13:04:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:34,016 INFO L225 Difference]: With dead ends: 1601 [2022-07-23 13:04:34,016 INFO L226 Difference]: Without dead ends: 1601 [2022-07-23 13:04:34,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-23 13:04:34,018 INFO L413 NwaCegarLoop]: 1204 mSDtfsCounter, 988 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:34,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1610 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-23 13:04:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-07-23 13:04:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1227. [2022-07-23 13:04:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 637 states have (on average 2.0172684458398744) internal successors, (1285), 1217 states have internal predecessors, (1285), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2022-07-23 13:04:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1327 transitions. [2022-07-23 13:04:34,044 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1327 transitions. Word has length 8 [2022-07-23 13:04:34,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:34,044 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 1327 transitions. [2022-07-23 13:04:34,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-23 13:04:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1327 transitions. [2022-07-23 13:04:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 13:04:34,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:34,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:34,057 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-23 13:04:34,255 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-23 13:04:34,255 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:34,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash -846217709, now seen corresponding path program 1 times [2022-07-23 13:04:34,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:34,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94230178] [2022-07-23 13:04:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:34,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:34,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:34,257 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-23 13:04:34,261 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-23 13:04:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:34,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:04:34,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:34,395 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-23 13:04:34,411 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-23 13:04:34,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:34,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:34,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94230178] [2022-07-23 13:04:34,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94230178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:34,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:34,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:04:34,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564856171] [2022-07-23 13:04:34,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:34,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:04:34,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:34,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:04:34,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:04:34,414 INFO L87 Difference]: Start difference. First operand 1227 states and 1327 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-23 13:04:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:36,576 INFO L93 Difference]: Finished difference Result 1694 states and 1828 transitions. [2022-07-23 13:04:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:04:36,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-23 13:04:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:36,584 INFO L225 Difference]: With dead ends: 1694 [2022-07-23 13:04:36,584 INFO L226 Difference]: Without dead ends: 1694 [2022-07-23 13:04:36,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-23 13:04:36,585 INFO L413 NwaCegarLoop]: 1421 mSDtfsCounter, 684 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:36,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 2010 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-23 13:04:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2022-07-23 13:04:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1469. [2022-07-23 13:04:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 887 states have (on average 2.0056369785794814) internal successors, (1779), 1457 states have internal predecessors, (1779), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2022-07-23 13:04:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1825 transitions. [2022-07-23 13:04:36,612 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1825 transitions. Word has length 8 [2022-07-23 13:04:36,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:36,612 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 1825 transitions. [2022-07-23 13:04:36,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-23 13:04:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1825 transitions. [2022-07-23 13:04:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 13:04:36,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:36,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:36,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 13:04:36,823 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-23 13:04:36,823 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1255764539, now seen corresponding path program 1 times [2022-07-23 13:04:36,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:36,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973920371] [2022-07-23 13:04:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:36,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:36,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:36,826 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-23 13:04:36,828 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-23 13:04:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:36,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:04:36,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:37,039 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-23 13:04:37,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:37,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:37,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973920371] [2022-07-23 13:04:37,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973920371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:37,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:37,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:04:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99968345] [2022-07-23 13:04:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:37,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:04:37,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:37,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:04:37,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:04:37,047 INFO L87 Difference]: Start difference. First operand 1469 states and 1825 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-23 13:04:37,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:37,425 INFO L93 Difference]: Finished difference Result 2286 states and 2860 transitions. [2022-07-23 13:04:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:04:37,426 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-23 13:04:37,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:37,434 INFO L225 Difference]: With dead ends: 2286 [2022-07-23 13:04:37,434 INFO L226 Difference]: Without dead ends: 2286 [2022-07-23 13:04:37,435 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-23 13:04:37,436 INFO L413 NwaCegarLoop]: 1443 mSDtfsCounter, 748 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 2563 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:37,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 2563 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 13:04:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-07-23 13:04:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 1869. [2022-07-23 13:04:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1285 states have (on average 1.9883268482490273) internal successors, (2555), 1855 states have internal predecessors, (2555), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2605 transitions. [2022-07-23 13:04:37,490 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2605 transitions. Word has length 11 [2022-07-23 13:04:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:37,491 INFO L495 AbstractCegarLoop]: Abstraction has 1869 states and 2605 transitions. [2022-07-23 13:04:37,491 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-23 13:04:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2605 transitions. [2022-07-23 13:04:37,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 13:04:37,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:37,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:37,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 13:04:37,701 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-23 13:04:37,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr344REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:37,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:37,702 INFO L85 PathProgramCache]: Analyzing trace with hash -680989669, now seen corresponding path program 1 times [2022-07-23 13:04:37,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:37,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184863532] [2022-07-23 13:04:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:37,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:37,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:37,704 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-23 13:04:37,705 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-23 13:04:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:37,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 13:04:37,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:37,846 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-23 13:04:37,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:37,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:37,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184863532] [2022-07-23 13:04:37,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184863532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:37,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:37,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:04:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977608013] [2022-07-23 13:04:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:37,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:04:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:37,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:04:37,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:04:37,849 INFO L87 Difference]: Start difference. First operand 1869 states and 2605 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 13:04:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:37,892 INFO L93 Difference]: Finished difference Result 1992 states and 2665 transitions. [2022-07-23 13:04:37,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:04:37,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 13:04:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:37,902 INFO L225 Difference]: With dead ends: 1992 [2022-07-23 13:04:37,903 INFO L226 Difference]: Without dead ends: 1992 [2022-07-23 13:04:37,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-23 13:04:37,904 INFO L413 NwaCegarLoop]: 1462 mSDtfsCounter, 585 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2352 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-23 13:04:37,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2352 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:04:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-07-23 13:04:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1773. [2022-07-23 13:04:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1213 states have (on average 1.964550700741962) internal successors, (2383), 1759 states have internal predecessors, (2383), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2433 transitions. [2022-07-23 13:04:37,946 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2433 transitions. Word has length 13 [2022-07-23 13:04:37,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:37,947 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2433 transitions. [2022-07-23 13:04:37,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-23 13:04:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2433 transitions. [2022-07-23 13:04:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 13:04:37,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:37,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:37,963 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-23 13:04:38,159 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-23 13:04:38,162 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr639ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1323693751, now seen corresponding path program 1 times [2022-07-23 13:04:38,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:38,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607207104] [2022-07-23 13:04:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:38,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:38,165 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-23 13:04:38,207 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-23 13:04:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:38,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 13:04:38,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:38,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 13:04:38,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 13:04:38,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 13:04:38,402 INFO L356 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2022-07-23 13:04:38,403 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 3 case distinctions, treesize of input 30 treesize of output 36 [2022-07-23 13:04:38,438 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-23 13:04:38,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2022-07-23 13:04:38,450 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-23 13:04:38,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:38,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:38,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607207104] [2022-07-23 13:04:38,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607207104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:38,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:38,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:04:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789149152] [2022-07-23 13:04:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:38,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:38,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:38,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:38,453 INFO L87 Difference]: Start difference. First operand 1773 states and 2433 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 13:04:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:39,632 INFO L93 Difference]: Finished difference Result 2415 states and 3336 transitions. [2022-07-23 13:04:39,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:04:39,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-07-23 13:04:39,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:39,641 INFO L225 Difference]: With dead ends: 2415 [2022-07-23 13:04:39,641 INFO L226 Difference]: Without dead ends: 2415 [2022-07-23 13:04:39,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-23 13:04:39,642 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 461 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:39,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 3538 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 13:04:39,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2022-07-23 13:04:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1772. [2022-07-23 13:04:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1212 states have (on average 1.9645214521452146) internal successors, (2381), 1758 states have internal predecessors, (2381), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2431 transitions. [2022-07-23 13:04:39,678 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2431 transitions. Word has length 14 [2022-07-23 13:04:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:39,678 INFO L495 AbstractCegarLoop]: Abstraction has 1772 states and 2431 transitions. [2022-07-23 13:04:39,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 13:04:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2431 transitions. [2022-07-23 13:04:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 13:04:39,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:39,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:39,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-23 13:04:39,890 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-23 13:04:39,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash -413650658, now seen corresponding path program 1 times [2022-07-23 13:04:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:39,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780118895] [2022-07-23 13:04:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:39,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:39,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:39,893 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-23 13:04:39,894 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-23 13:04:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:40,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 13:04:40,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:40,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-23 13:04:40,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:40,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:40,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780118895] [2022-07-23 13:04:40,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780118895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:40,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:40,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:04:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559731942] [2022-07-23 13:04:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:40,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:04:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:40,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:04:40,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 13:04:40,054 INFO L87 Difference]: Start difference. First operand 1772 states and 2431 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-23 13:04:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:40,084 INFO L93 Difference]: Finished difference Result 1712 states and 2345 transitions. [2022-07-23 13:04:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:04:40,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-07-23 13:04:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:40,093 INFO L225 Difference]: With dead ends: 1712 [2022-07-23 13:04:40,093 INFO L226 Difference]: Without dead ends: 1712 [2022-07-23 13:04:40,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-23 13:04:40,095 INFO L413 NwaCegarLoop]: 1219 mSDtfsCounter, 1131 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1311 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-23 13:04:40,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:04:40,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-07-23 13:04:40,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2022-07-23 13:04:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1176 states have (on average 1.9515306122448979) internal successors, (2295), 1698 states have internal predecessors, (2295), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2345 transitions. [2022-07-23 13:04:40,141 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2345 transitions. Word has length 18 [2022-07-23 13:04:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:40,141 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2345 transitions. [2022-07-23 13:04:40,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-23 13:04:40,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2345 transitions. [2022-07-23 13:04:40,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 13:04:40,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:40,143 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] [2022-07-23 13:04:40,155 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-23 13:04:40,353 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-23 13:04:40,354 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:40,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1913675577, now seen corresponding path program 1 times [2022-07-23 13:04:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:40,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661039960] [2022-07-23 13:04:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:40,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:40,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:40,364 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-23 13:04:40,365 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-23 13:04:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:40,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:04:40,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:40,524 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-23 13:04:40,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:40,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:40,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661039960] [2022-07-23 13:04:40,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661039960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:40,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:40,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:04:40,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902370033] [2022-07-23 13:04:40,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:40,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:40,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:40,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:40,527 INFO L87 Difference]: Start difference. First operand 1712 states and 2345 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-23 13:04:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:40,580 INFO L93 Difference]: Finished difference Result 1684 states and 2289 transitions. [2022-07-23 13:04:40,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:04:40,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-07-23 13:04:40,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:40,584 INFO L225 Difference]: With dead ends: 1684 [2022-07-23 13:04:40,585 INFO L226 Difference]: Without dead ends: 1684 [2022-07-23 13:04:40,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-23 13:04:40,586 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1102 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 2433 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-23 13:04:40,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 2433 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:04:40,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-07-23 13:04:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1682. [2022-07-23 13:04:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1160 states have (on average 1.928448275862069) internal successors, (2237), 1668 states have internal predecessors, (2237), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2287 transitions. [2022-07-23 13:04:40,616 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2287 transitions. Word has length 20 [2022-07-23 13:04:40,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:40,616 INFO L495 AbstractCegarLoop]: Abstraction has 1682 states and 2287 transitions. [2022-07-23 13:04:40,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-23 13:04:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2287 transitions. [2022-07-23 13:04:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 13:04:40,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:40,618 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] [2022-07-23 13:04:40,631 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-23 13:04:40,828 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-23 13:04:40,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753126, now seen corresponding path program 1 times [2022-07-23 13:04:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:40,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821438205] [2022-07-23 13:04:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:40,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:40,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:40,831 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-23 13:04:40,832 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-23 13:04:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:41,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:04:41,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:41,027 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-23 13:04:41,101 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-23 13:04:41,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:41,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:41,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821438205] [2022-07-23 13:04:41,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821438205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:41,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:41,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:04:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322476404] [2022-07-23 13:04:41,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:41,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:41,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:41,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:41,104 INFO L87 Difference]: Start difference. First operand 1682 states and 2287 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-23 13:04:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:42,940 INFO L93 Difference]: Finished difference Result 2541 states and 3552 transitions. [2022-07-23 13:04:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:04:42,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-07-23 13:04:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:42,948 INFO L225 Difference]: With dead ends: 2541 [2022-07-23 13:04:42,948 INFO L226 Difference]: Without dead ends: 2541 [2022-07-23 13:04:42,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-23 13:04:42,948 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 2164 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2166 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:42,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2166 Valid, 1290 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-23 13:04:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2022-07-23 13:04:42,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 1678. [2022-07-23 13:04:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1160 states have (on average 1.921551724137931) internal successors, (2229), 1664 states have internal predecessors, (2229), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:42,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2279 transitions. [2022-07-23 13:04:42,986 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2279 transitions. Word has length 34 [2022-07-23 13:04:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:42,988 INFO L495 AbstractCegarLoop]: Abstraction has 1678 states and 2279 transitions. [2022-07-23 13:04:42,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-23 13:04:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2279 transitions. [2022-07-23 13:04:42,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 13:04:42,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:42,990 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] [2022-07-23 13:04:43,002 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-23 13:04:43,200 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-23 13:04:43,200 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:43,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1224753127, now seen corresponding path program 1 times [2022-07-23 13:04:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:43,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140146912] [2022-07-23 13:04:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:43,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:43,204 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-23 13:04:43,206 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-23 13:04:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:43,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 13:04:43,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:43,400 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-23 13:04:43,557 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-23 13:04:43,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:43,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:43,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140146912] [2022-07-23 13:04:43,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140146912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:43,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:43,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:04:43,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209013105] [2022-07-23 13:04:43,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:43,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:43,559 INFO L87 Difference]: Start difference. First operand 1678 states and 2279 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-23 13:04:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:46,438 INFO L93 Difference]: Finished difference Result 2089 states and 2498 transitions. [2022-07-23 13:04:46,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:04:46,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2022-07-23 13:04:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:46,444 INFO L225 Difference]: With dead ends: 2089 [2022-07-23 13:04:46,445 INFO L226 Difference]: Without dead ends: 2089 [2022-07-23 13:04:46,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-23 13:04:46,445 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 1298 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:46,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 2787 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-23 13:04:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-07-23 13:04:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1674. [2022-07-23 13:04:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1160 states have (on average 1.914655172413793) internal successors, (2221), 1660 states have internal predecessors, (2221), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:46,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2271 transitions. [2022-07-23 13:04:46,473 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2271 transitions. Word has length 34 [2022-07-23 13:04:46,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:46,473 INFO L495 AbstractCegarLoop]: Abstraction has 1674 states and 2271 transitions. [2022-07-23 13:04:46,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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-23 13:04:46,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2271 transitions. [2022-07-23 13:04:46,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 13:04:46,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:46,478 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] [2022-07-23 13:04:46,492 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-23 13:04:46,688 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-23 13:04:46,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash -515146363, now seen corresponding path program 1 times [2022-07-23 13:04:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:46,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792464819] [2022-07-23 13:04:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:46,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:46,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:46,691 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-23 13:04:46,694 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-23 13:04:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:46,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:04:46,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:46,962 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-23 13:04:46,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:46,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:46,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792464819] [2022-07-23 13:04:46,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792464819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:46,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:46,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:04:46,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464574570] [2022-07-23 13:04:46,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:46,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:46,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:46,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:46,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:46,965 INFO L87 Difference]: Start difference. First operand 1674 states and 2271 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-23 13:04:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:47,010 INFO L93 Difference]: Finished difference Result 1662 states and 2251 transitions. [2022-07-23 13:04:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:04:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-07-23 13:04:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:47,023 INFO L225 Difference]: With dead ends: 1662 [2022-07-23 13:04:47,023 INFO L226 Difference]: Without dead ends: 1662 [2022-07-23 13:04:47,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-23 13:04:47,025 INFO L413 NwaCegarLoop]: 1168 mSDtfsCounter, 1078 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1083 SdHoareTripleChecker+Valid, 2411 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-23 13:04:47,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1083 Valid, 2411 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:04:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2022-07-23 13:04:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1662. [2022-07-23 13:04:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1148 states have (on average 1.9172473867595818) internal successors, (2201), 1648 states have internal predecessors, (2201), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-23 13:04:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2251 transitions. [2022-07-23 13:04:47,059 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2251 transitions. Word has length 52 [2022-07-23 13:04:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:47,061 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2251 transitions. [2022-07-23 13:04:47,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-23 13:04:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2251 transitions. [2022-07-23 13:04:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-23 13:04:47,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:47,064 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] [2022-07-23 13:04:47,078 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-23 13:04:47,275 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-23 13:04:47,276 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1189287633, now seen corresponding path program 1 times [2022-07-23 13:04:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:47,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134266586] [2022-07-23 13:04:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:47,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:47,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:47,278 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-23 13:04:47,280 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-23 13:04:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:47,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 13:04:47,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:47,662 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-23 13:04:47,668 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-23 13:04:48,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 13:04:48,054 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-23 13:04:48,064 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 13:04:48,064 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-23 13:04:48,076 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-23 13:04:48,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:48,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:48,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134266586] [2022-07-23 13:04:48,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134266586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:48,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:48,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:04:48,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889179340] [2022-07-23 13:04:48,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:48,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:48,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:48,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:48,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:48,078 INFO L87 Difference]: Start difference. First operand 1662 states and 2251 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-23 13:04:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:49,742 INFO L93 Difference]: Finished difference Result 1633 states and 2223 transitions. [2022-07-23 13:04:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:04:49,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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 60 [2022-07-23 13:04:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:49,747 INFO L225 Difference]: With dead ends: 1633 [2022-07-23 13:04:49,747 INFO L226 Difference]: Without dead ends: 1633 [2022-07-23 13:04:49,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-23 13:04:49,748 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 833 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 868 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:49,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 888 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 868 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-23 13:04:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-07-23 13:04:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1250. [2022-07-23 13:04:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 779 states have (on average 1.8318356867779204) internal successors, (1427), 1239 states have internal predecessors, (1427), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-23 13:04:49,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1471 transitions. [2022-07-23 13:04:49,765 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1471 transitions. Word has length 60 [2022-07-23 13:04:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:49,766 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1471 transitions. [2022-07-23 13:04:49,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 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-23 13:04:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1471 transitions. [2022-07-23 13:04:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 13:04:49,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:49,767 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] [2022-07-23 13:04:49,781 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-23 13:04:49,980 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-23 13:04:49,981 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054235, now seen corresponding path program 1 times [2022-07-23 13:04:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:49,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129925656] [2022-07-23 13:04:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:49,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:49,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:49,987 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-23 13:04:49,988 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-23 13:04:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:50,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 13:04:50,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:50,253 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-23 13:04:50,264 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-23 13:04:50,287 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-23 13:04:50,297 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-23 13:04:50,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:50,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:50,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129925656] [2022-07-23 13:04:50,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129925656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:50,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:50,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:04:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098604101] [2022-07-23 13:04:50,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:50,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:04:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:50,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:04:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:04:50,302 INFO L87 Difference]: Start difference. First operand 1250 states and 1471 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-23 13:04:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:52,203 INFO L93 Difference]: Finished difference Result 1249 states and 1470 transitions. [2022-07-23 13:04:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 13:04:52,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-07-23 13:04:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:52,206 INFO L225 Difference]: With dead ends: 1249 [2022-07-23 13:04:52,206 INFO L226 Difference]: Without dead ends: 1249 [2022-07-23 13:04:52,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-23 13:04:52,207 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 4 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1552 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:52,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2957 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1552 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-23 13:04:52,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2022-07-23 13:04:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2022-07-23 13:04:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 779 states have (on average 1.8305519897304237) internal successors, (1426), 1238 states have internal predecessors, (1426), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-23 13:04:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1470 transitions. [2022-07-23 13:04:52,223 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1470 transitions. Word has length 65 [2022-07-23 13:04:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:52,223 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1470 transitions. [2022-07-23 13:04:52,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-23 13:04:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1470 transitions. [2022-07-23 13:04:52,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 13:04:52,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:52,224 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] [2022-07-23 13:04:52,239 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-23 13:04:52,437 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-23 13:04:52,437 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054234, now seen corresponding path program 1 times [2022-07-23 13:04:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:52,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003286671] [2022-07-23 13:04:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:52,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:52,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:52,440 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-23 13:04:52,441 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-23 13:04:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:52,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 13:04:52,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:52,715 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-23 13:04:52,731 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-23 13:04:52,739 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-23 13:04:52,784 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-23 13:04:52,792 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-23 13:04:52,808 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-23 13:04:52,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:52,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:52,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003286671] [2022-07-23 13:04:52,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003286671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:52,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:52,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:04:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211248726] [2022-07-23 13:04:52,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:52,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:04:52,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:04:52,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 13:04:52,811 INFO L87 Difference]: Start difference. First operand 1249 states and 1470 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-23 13:04:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:55,531 INFO L93 Difference]: Finished difference Result 1248 states and 1469 transitions. [2022-07-23 13:04:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 13:04:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2022-07-23 13:04:55,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:55,534 INFO L225 Difference]: With dead ends: 1248 [2022-07-23 13:04:55,534 INFO L226 Difference]: Without dead ends: 1248 [2022-07-23 13:04:55,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 13:04:55,535 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:55,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3018 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 13:04:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-07-23 13:04:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2022-07-23 13:04:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 778 states have (on average 1.8316195372750643) internal successors, (1425), 1237 states have internal predecessors, (1425), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2022-07-23 13:04:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1469 transitions. [2022-07-23 13:04:55,550 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1469 transitions. Word has length 65 [2022-07-23 13:04:55,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:55,551 INFO L495 AbstractCegarLoop]: Abstraction has 1248 states and 1469 transitions. [2022-07-23 13:04:55,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 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-23 13:04:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1469 transitions. [2022-07-23 13:04:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-23 13:04:55,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:55,552 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, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:55,565 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-23 13:04:55,765 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-23 13:04:55,765 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash 827014060, now seen corresponding path program 1 times [2022-07-23 13:04:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:55,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353450082] [2022-07-23 13:04:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:55,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:55,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:55,770 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-23 13:04:55,770 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-23 13:04:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:56,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 13:04:56,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:56,043 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-23 13:04:56,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:04:56,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:56,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353450082] [2022-07-23 13:04:56,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353450082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:04:56,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:04:56,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:04:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986110035] [2022-07-23 13:04:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:04:56,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:04:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:56,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:04:56,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:04:56,046 INFO L87 Difference]: Start difference. First operand 1248 states and 1469 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-23 13:04:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:56,089 INFO L93 Difference]: Finished difference Result 1251 states and 1473 transitions. [2022-07-23 13:04:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:04:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2022-07-23 13:04:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:56,094 INFO L225 Difference]: With dead ends: 1251 [2022-07-23 13:04:56,094 INFO L226 Difference]: Without dead ends: 1251 [2022-07-23 13:04:56,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-23 13:04:56,095 INFO L413 NwaCegarLoop]: 1126 mSDtfsCounter, 2 mSDsluCounter, 2247 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3373 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:56,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3373 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 13:04:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2022-07-23 13:04:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2022-07-23 13:04:56,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 780 states have (on average 1.8307692307692307) internal successors, (1428), 1240 states have internal predecessors, (1428), 22 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-23 13:04:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1473 transitions. [2022-07-23 13:04:56,113 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1473 transitions. Word has length 73 [2022-07-23 13:04:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:56,113 INFO L495 AbstractCegarLoop]: Abstraction has 1251 states and 1473 transitions. [2022-07-23 13:04:56,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-23 13:04:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1473 transitions. [2022-07-23 13:04:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 13:04:56,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:56,114 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:56,131 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-23 13:04:56,331 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-23 13:04:56,332 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 505961995, now seen corresponding path program 1 times [2022-07-23 13:04:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:56,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524176180] [2022-07-23 13:04:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:04:56,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:56,335 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-23 13:04:56,335 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-23 13:04:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:04:56,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:04:56,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:56,627 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-23 13:04:56,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:04:56,697 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-23 13:04:56,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:56,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524176180] [2022-07-23 13:04:56,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524176180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:04:56,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:04:56,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 13:04:56,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963724631] [2022-07-23 13:04:56,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:04:56,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 13:04:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 13:04:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 13:04:56,699 INFO L87 Difference]: Start difference. First operand 1251 states and 1473 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-23 13:04:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:56,838 INFO L93 Difference]: Finished difference Result 1263 states and 1490 transitions. [2022-07-23 13:04:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:04:56,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 74 [2022-07-23 13:04:56,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:56,841 INFO L225 Difference]: With dead ends: 1263 [2022-07-23 13:04:56,842 INFO L226 Difference]: Without dead ends: 1263 [2022-07-23 13:04:56,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 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-23 13:04:56,842 INFO L413 NwaCegarLoop]: 1127 mSDtfsCounter, 15 mSDsluCounter, 4491 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5618 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:56,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5618 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 13:04:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2022-07-23 13:04:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1261. [2022-07-23 13:04:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 789 states have (on average 1.8288973384030418) internal successors, (1443), 1249 states have internal predecessors, (1443), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-23 13:04:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1488 transitions. [2022-07-23 13:04:56,866 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1488 transitions. Word has length 74 [2022-07-23 13:04:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:56,866 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1488 transitions. [2022-07-23 13:04:56,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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-23 13:04:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1488 transitions. [2022-07-23 13:04:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 13:04:56,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:56,867 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:56,886 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-23 13:04:57,080 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-23 13:04:57,081 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash 279993196, now seen corresponding path program 2 times [2022-07-23 13:04:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:57,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321052440] [2022-07-23 13:04:57,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 13:04:57,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:57,083 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-23 13:04:57,086 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-23 13:04:57,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 13:04:57,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:04:57,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 13:04:57,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:57,589 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-23 13:04:57,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:04:57,735 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-23 13:04:57,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:57,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321052440] [2022-07-23 13:04:57,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321052440] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:04:57,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:04:57,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 13:04:57,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006833537] [2022-07-23 13:04:57,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:04:57,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 13:04:57,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:57,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 13:04:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 13:04:57,737 INFO L87 Difference]: Start difference. First operand 1261 states and 1488 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-23 13:04:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:04:58,230 INFO L93 Difference]: Finished difference Result 1282 states and 1516 transitions. [2022-07-23 13:04:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 13:04:58,230 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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 77 [2022-07-23 13:04:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:04:58,233 INFO L225 Difference]: With dead ends: 1282 [2022-07-23 13:04:58,233 INFO L226 Difference]: Without dead ends: 1278 [2022-07-23 13:04:58,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-23 13:04:58,234 INFO L413 NwaCegarLoop]: 1130 mSDtfsCounter, 62 mSDsluCounter, 5634 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 6764 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:04:58,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 6764 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 13:04:58,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2022-07-23 13:04:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1270. [2022-07-23 13:04:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 798 states have (on average 1.8233082706766917) internal successors, (1455), 1258 states have internal predecessors, (1455), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-23 13:04:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1500 transitions. [2022-07-23 13:04:58,251 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1500 transitions. Word has length 77 [2022-07-23 13:04:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:04:58,252 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1500 transitions. [2022-07-23 13:04:58,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 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-23 13:04:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1500 transitions. [2022-07-23 13:04:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 13:04:58,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:04:58,253 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:04:58,271 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-23 13:04:58,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:04:58,467 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:04:58,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:04:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash -183892212, now seen corresponding path program 3 times [2022-07-23 13:04:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:04:58,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840144719] [2022-07-23 13:04:58,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 13:04:58,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:04:58,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:04:58,470 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:04:58,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-23 13:04:59,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 13:04:59,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:04:59,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 13:04:59,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:04:59,268 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-23 13:04:59,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:04:59,881 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-23 13:04:59,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:04:59,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840144719] [2022-07-23 13:04:59,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840144719] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:04:59,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:04:59,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 13:04:59,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767268425] [2022-07-23 13:04:59,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:04:59,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 13:04:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:04:59,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 13:04:59,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 13:04:59,884 INFO L87 Difference]: Start difference. First operand 1270 states and 1500 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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-23 13:05:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:05:02,644 INFO L93 Difference]: Finished difference Result 1312 states and 1562 transitions. [2022-07-23 13:05:02,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 13:05:02,645 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 83 [2022-07-23 13:05:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:05:02,648 INFO L225 Difference]: With dead ends: 1312 [2022-07-23 13:05:02,648 INFO L226 Difference]: Without dead ends: 1306 [2022-07-23 13:05:02,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 13:05:02,649 INFO L413 NwaCegarLoop]: 1135 mSDtfsCounter, 181 mSDsluCounter, 13562 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 14697 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 13:05:02,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 14697 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 13:05:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2022-07-23 13:05:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1288. [2022-07-23 13:05:02,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 816 states have (on average 1.8112745098039216) internal successors, (1478), 1276 states have internal predecessors, (1478), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-23 13:05:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1523 transitions. [2022-07-23 13:05:02,680 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1523 transitions. Word has length 83 [2022-07-23 13:05:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:05:02,680 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1523 transitions. [2022-07-23 13:05:02,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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-23 13:05:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1523 transitions. [2022-07-23 13:05:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 13:05:02,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:05:02,681 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:05:02,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 13:05:02,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:05:02,897 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:05:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:05:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash 171030092, now seen corresponding path program 4 times [2022-07-23 13:05:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:05:02,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614721180] [2022-07-23 13:05:02,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 13:05:02,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:05:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:05:02,901 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-23 13:05:02,903 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-23 13:05:03,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 13:05:03,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:05:03,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 13:05:03,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:05:03,558 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-23 13:05:03,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:05:04,957 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-23 13:05:04,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:05:04,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614721180] [2022-07-23 13:05:04,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614721180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 13:05:04,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:05:04,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 13:05:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618550078] [2022-07-23 13:05:04,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:05:04,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 13:05:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:05:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 13:05:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 13:05:04,960 INFO L87 Difference]: Start difference. First operand 1288 states and 1523 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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-23 13:05:14,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:05:14,965 INFO L93 Difference]: Finished difference Result 1368 states and 1635 transitions. [2022-07-23 13:05:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 13:05:14,966 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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 95 [2022-07-23 13:05:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:05:14,968 INFO L225 Difference]: With dead ends: 1368 [2022-07-23 13:05:14,968 INFO L226 Difference]: Without dead ends: 1364 [2022-07-23 13:05:14,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 13:05:14,972 INFO L413 NwaCegarLoop]: 1147 mSDtfsCounter, 369 mSDsluCounter, 27415 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 28562 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 13:05:14,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 28562 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-23 13:05:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2022-07-23 13:05:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1322. [2022-07-23 13:05:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 850 states have (on average 1.7929411764705883) internal successors, (1524), 1310 states have internal predecessors, (1524), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-23 13:05:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1569 transitions. [2022-07-23 13:05:14,992 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1569 transitions. Word has length 95 [2022-07-23 13:05:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:05:14,992 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1569 transitions. [2022-07-23 13:05:14,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 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-23 13:05:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1569 transitions. [2022-07-23 13:05:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 13:05:14,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:05:14,993 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:05:15,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-23 13:05:15,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:05:15,209 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:05:15,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:05:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422612, now seen corresponding path program 5 times [2022-07-23 13:05:15,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:05:15,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825264556] [2022-07-23 13:05:15,210 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 13:05:15,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:05:15,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:05:15,212 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:05:15,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-23 13:05:16,580 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 13:05:16,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:05:16,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 13:05:16,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:05:16,634 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-23 13:05:16,706 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 13:05:16,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 13:05:16,729 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-23 13:05:16,792 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 22 treesize of output 10 [2022-07-23 13:05:17,420 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |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)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927)))) is different from true [2022-07-23 13:05:18,156 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 13:05:18,156 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 34 treesize of output 35 [2022-07-23 13:05:18,184 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 31 treesize of output 13 [2022-07-23 13:05:18,210 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-23 13:05:18,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:05:18,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:05:18,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825264556] [2022-07-23 13:05:18,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825264556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:05:18,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2051428864] [2022-07-23 13:05:18,466 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 13:05:18,466 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 13:05:18,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 13:05:18,468 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 13:05:18,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2022-07-23 13:06:53,891 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 13:06:53,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:06:54,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-23 13:06:54,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:06:54,156 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-23 13:06:54,264 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 13:06:54,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 13:06:54,278 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-23 13:06:54,324 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 22 treesize of output 10 [2022-07-23 13:06:54,706 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |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)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382)))) is different from true [2022-07-23 13:06:54,720 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |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)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383)))) is different from true [2022-07-23 13:06:55,434 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |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)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-07-23 13:06:55,612 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 13:06:55,613 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 34 treesize of output 35 [2022-07-23 13:06:55,654 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 31 treesize of output 13 [2022-07-23 13:06:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 820 trivial. 129 not checked. [2022-07-23 13:06:55,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:06:55,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2051428864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:06:55,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:06:55,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 12 [2022-07-23 13:06:55,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978439238] [2022-07-23 13:06:55,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:06:55,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 13:06:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:06:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 13:06:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=13, NotChecked=92, Total=240 [2022-07-23 13:06:55,935 INFO L87 Difference]: Start difference. First operand 1322 states and 1569 transitions. Second operand has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 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-23 13:06:56,248 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |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)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1908))) (exists ((v_ArrVal_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-07-23 13:06:56,251 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32))) (and (not (= v_arrayElimCell_16 |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)) (= (select |c_#valid| v_arrayElimCell_16) (_ bv1 1)))) (exists ((v_ArrVal_2382 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2382))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_2383 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2383))) (exists ((v_ArrVal_1908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1908))) (exists ((v_ArrVal_2410 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2410)))) is different from true [2022-07-23 13:06:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:06:58,928 INFO L93 Difference]: Finished difference Result 1332 states and 1577 transitions. [2022-07-23 13:06:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 13:06:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 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 117 [2022-07-23 13:06:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:06:58,931 INFO L225 Difference]: With dead ends: 1332 [2022-07-23 13:06:58,931 INFO L226 Difference]: Without dead ends: 1328 [2022-07-23 13:06:58,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 139 SyntacticMatches, 87 SemanticMatches, 18 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=54, Invalid=135, Unknown=17, NotChecked=174, Total=380 [2022-07-23 13:06:58,932 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 759 mSDsluCounter, 2891 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 8552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6685 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-23 13:06:58,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 3631 Invalid, 8552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1859 Invalid, 0 Unknown, 6685 Unchecked, 2.9s Time] [2022-07-23 13:06:58,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-07-23 13:06:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1321. [2022-07-23 13:06:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 850 states have (on average 1.7870588235294118) internal successors, (1519), 1309 states have internal predecessors, (1519), 22 states have call successors, (22), 4 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2022-07-23 13:06:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1564 transitions. [2022-07-23 13:06:58,948 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1564 transitions. Word has length 117 [2022-07-23 13:06:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:06:58,948 INFO L495 AbstractCegarLoop]: Abstraction has 1321 states and 1564 transitions. [2022-07-23 13:06:58,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 13 states have internal predecessors, (80), 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-23 13:06:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1564 transitions. [2022-07-23 13:06:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 13:06:58,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:06:58,949 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:06:58,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2022-07-23 13:06:59,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-23 13:06:59,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 13:06:59,377 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 638 more)] === [2022-07-23 13:06:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:06:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1801422611, now seen corresponding path program 1 times [2022-07-23 13:06:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 13:06:59,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944349598] [2022-07-23 13:06:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:06:59,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 13:06:59,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 13:06:59,379 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 13:06:59,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-23 13:07:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:07:00,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-23 13:07:00,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:07:00,177 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-23 13:07:00,281 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-23 13:07:00,292 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 13:07:00,292 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-23 13:07:00,312 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-23 13:07:00,323 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-23 13:07:00,411 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 22 treesize of output 10 [2022-07-23 13:07:00,416 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 9 treesize of output 3 [2022-07-23 13:07:00,464 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2837) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2836 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2836)))) is different from true [2022-07-23 13:07:00,561 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2844 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2844))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2845 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2845)))) is different from true [2022-07-23 13:07:00,571 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2847) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2846 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2846) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:07:00,582 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2848))) (exists ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2849) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 13:07:00,589 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2850))) (exists ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2851) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:07:00,599 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2853 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2853) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2852)))) is different from true [2022-07-23 13:07:00,609 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2855 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2855))) (exists ((v_ArrVal_2854 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2854)))) is different from true [2022-07-23 13:07:00,625 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2857 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2857) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2856 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2856))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 13:07:00,633 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2858 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2858))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2859 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2859) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:07:00,738 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2869 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2869))) (exists ((v_ArrVal_2868 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2868) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 13:07:00,745 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2870) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2871 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2871)))) is different from true [2022-07-23 13:07:00,754 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2872 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2872) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2873 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2873))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 13:07:00,762 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2875 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2875))) (exists ((v_ArrVal_2874 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2874)))) is different from true [2022-07-23 13:07:00,775 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2877 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2877))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2876 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2876)))) is different from true [2022-07-23 13:07:00,783 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2878) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2879 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2879) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:07:00,791 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2881))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2880 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2880) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:07:00,823 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2884))) (exists ((v_ArrVal_2885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2885))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 13:07:00,832 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2886 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2886) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2887 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2887)))) is different from true [2022-07-23 13:07:00,887 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2892 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2892) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2893 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2893) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:07:00,894 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2895 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2895) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2894)))) is different from true [2022-07-23 13:07:00,902 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2896))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2897)))) is different from true [2022-07-23 13:07:00,909 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2899 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2899))) (exists ((v_ArrVal_2898 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2898)))) is different from true [2022-07-23 13:07:00,917 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2901 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2901))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2900 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2900) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:07:00,928 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2902 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2902) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2903)))) is different from true [2022-07-23 13:07:00,935 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2905 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2905))) (exists ((v_ArrVal_2904 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2904)))) is different from true [2022-07-23 13:07:00,943 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2906))) (exists ((v_ArrVal_2907 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2907) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:07:00,977 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2911))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2910)))) is different from true [2022-07-23 13:07:01,007 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2914) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2915 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2915) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:07:01,026 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2917))) (exists ((v_ArrVal_2916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2916)))) is different from true [2022-07-23 13:07:01,036 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2919))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32)))) is different from true [2022-07-23 13:07:01,046 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2921 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2921) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2920)))) is different from true [2022-07-23 13:07:01,057 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_26) (_ bv44 32))) (exists ((v_ArrVal_2922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2922))) (exists ((v_ArrVal_2923 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2923) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 13:07:01,089 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 13:07:01,089 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-23 13:07:01,095 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-23 13:07:01,135 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 31 treesize of output 13 [2022-07-23 13:07:01,140 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 19 treesize of output 7 [2022-07-23 13:07:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 66 trivial. 912 not checked. [2022-07-23 13:07:01,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:07:01,951 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3014 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3015) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3014) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3015 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3015) |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 (_ bv20 32) .cse1))))) is different from false [2022-07-23 13:07:01,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 13:07:01,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944349598] [2022-07-23 13:07:01,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944349598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:07:01,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1881978736] [2022-07-23 13:07:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:07:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 13:07:01,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 13:07:01,964 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 13:07:01,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process