./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-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_OAT_test9-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 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:57:13,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:57:13,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:57:13,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:57:13,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:57:13,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:57:13,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:57:13,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:57:13,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:57:13,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:57:13,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:57:13,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:57:13,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:57:13,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:57:13,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:57:13,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:57:13,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:57:13,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:57:13,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:57:13,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:57:13,224 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:57:13,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:57:13,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:57:13,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:57:13,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:57:13,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:57:13,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:57:13,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:57:13,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:57:13,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:57:13,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:57:13,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:57:13,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:57:13,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:57:13,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:57:13,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:57:13,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:57:13,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:57:13,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:57:13,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:57:13,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:57:13,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:57:13,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 12:57:13,284 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:57:13,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:57:13,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:57:13,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:57:13,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:57:13,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:57:13,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:57:13,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:57:13,287 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:57:13,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:57:13,288 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:57:13,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:57:13,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:57:13,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:57:13,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:57:13,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:57:13,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:57:13,290 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:57:13,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:57:13,290 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:57:13,290 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:57:13,290 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:57:13,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:57:13,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:57:13,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:57:13,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:57:13,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:57:13,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:57:13,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 12:57:13,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 12:57:13,292 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 -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2022-07-23 12:57:13,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:57:13,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:57:13,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:57:13,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:57:13,538 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:57:13,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2022-07-23 12:57:13,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae3541e0/8760deb908a441e5907c10d3d90b78f5/FLAG048a04422 [2022-07-23 12:57:14,140 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:57:14,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2022-07-23 12:57:14,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae3541e0/8760deb908a441e5907c10d3d90b78f5/FLAG048a04422 [2022-07-23 12:57:14,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae3541e0/8760deb908a441e5907c10d3d90b78f5 [2022-07-23 12:57:14,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:57:14,410 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:57:14,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:57:14,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:57:14,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:57:14,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:57:14" (1/1) ... [2022-07-23 12:57:14,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7bb8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:14, skipping insertion in model container [2022-07-23 12:57:14,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:57:14" (1/1) ... [2022-07-23 12:57:14,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:57:14,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:57:14,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[33021,33034] [2022-07-23 12:57:15,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[84583,84596] [2022-07-23 12:57:15,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:57:15,077 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 12:57:15,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3de6b8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:15, skipping insertion in model container [2022-07-23 12:57:15,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:57:15,078 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 12:57:15,080 INFO L158 Benchmark]: Toolchain (without parser) took 669.32ms. Allocated memory is still 98.6MB. Free memory was 62.3MB in the beginning and 49.9MB in the end (delta: 12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 12:57:15,081 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 75.5MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 12:57:15,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.48ms. Allocated memory is still 98.6MB. Free memory was 62.1MB in the beginning and 49.9MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 12:57:15,082 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.21ms. Allocated memory is still 75.5MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.48ms. Allocated memory is still 98.6MB. Free memory was 62.1MB in the beginning and 49.9MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-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 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:57:16,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:57:16,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:57:16,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:57:16,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:57:16,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:57:16,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:57:16,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:57:16,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:57:16,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:57:16,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:57:16,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:57:16,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:57:16,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:57:16,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:57:16,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:57:16,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:57:16,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:57:16,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:57:16,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:57:16,926 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:57:16,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:57:16,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:57:16,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:57:16,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:57:16,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:57:16,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:57:16,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:57:16,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:57:16,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:57:16,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:57:16,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:57:16,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:57:16,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:57:16,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:57:16,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:57:16,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:57:16,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:57:16,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:57:16,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:57:16,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:57:16,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:57:16,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 12:57:16,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:57:16,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:57:16,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:57:16,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:57:16,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:57:16,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:57:16,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:57:16,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:57:16,992 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:57:16,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:57:16,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 12:57:16,993 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:57:16,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:57:16,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 12:57:16,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:57:16,994 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:57:16,994 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:57:16,994 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:57:16,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:57:16,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:57:16,995 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 12:57:16,995 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 12:57:16,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 12:57:16,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:57:16,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:57:16,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:57:16,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:57:16,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:57:16,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:57:16,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:57:16,997 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 12:57:16,997 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 12:57:16,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 12:57:16,998 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 -> 0672e9446c2cfbd152a4f960adca314d72e71aa68b29fd9a83ebc5c34f7546dd [2022-07-23 12:57:17,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:57:17,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:57:17,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:57:17,379 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:57:17,380 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:57:17,382 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2022-07-23 12:57:17,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ccf2166/428b0085cafe405d94340e3e500343ba/FLAG874543541 [2022-07-23 12:57:18,072 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:57:18,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i [2022-07-23 12:57:18,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ccf2166/428b0085cafe405d94340e3e500343ba/FLAG874543541 [2022-07-23 12:57:18,454 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ccf2166/428b0085cafe405d94340e3e500343ba [2022-07-23 12:57:18,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:57:18,458 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:57:18,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:57:18,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:57:18,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:57:18,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:57:18" (1/1) ... [2022-07-23 12:57:18,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f90d0b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:18, skipping insertion in model container [2022-07-23 12:57:18,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:57:18" (1/1) ... [2022-07-23 12:57:18,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:57:18,540 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:57:19,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[33021,33034] [2022-07-23 12:57:19,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[84583,84596] [2022-07-23 12:57:19,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:57:19,290 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 12:57:19,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:57:19,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[33021,33034] [2022-07-23 12:57:19,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[84583,84596] [2022-07-23 12:57:19,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:57:19,436 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 12:57:19,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[33021,33034] [2022-07-23 12:57:19,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test9-2.i[84583,84596] [2022-07-23 12:57:19,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:57:19,557 INFO L208 MainTranslator]: Completed translation [2022-07-23 12:57:19,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19 WrapperNode [2022-07-23 12:57:19,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:57:19,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 12:57:19,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 12:57:19,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 12:57:19,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,703 INFO L137 Inliner]: procedures = 180, calls = 781, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3034 [2022-07-23 12:57:19,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 12:57:19,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 12:57:19,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 12:57:19,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 12:57:19,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 12:57:19,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 12:57:19,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 12:57:19,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 12:57:19,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (1/1) ... [2022-07-23 12:57:19,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:57:19,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 12:57:19,925 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 12:57:19,949 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 12:57:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-23 12:57:19,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 12:57:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 12:57:19,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 12:57:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-23 12:57:19,966 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-23 12:57:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 12:57:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 12:57:19,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 12:57:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 12:57:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-23 12:57:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 12:57:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 12:57:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 12:57:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 12:57:19,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 12:57:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 12:57:20,144 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 12:57:20,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 12:57:20,149 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-23 12:57:25,289 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 12:57:25,306 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 12:57:25,307 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2022-07-23 12:57:25,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:57:25 BoogieIcfgContainer [2022-07-23 12:57:25,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 12:57:25,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 12:57:25,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 12:57:25,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 12:57:25,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:57:18" (1/3) ... [2022-07-23 12:57:25,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3283de08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:57:25, skipping insertion in model container [2022-07-23 12:57:25,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:57:19" (2/3) ... [2022-07-23 12:57:25,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3283de08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:57:25, skipping insertion in model container [2022-07-23 12:57:25,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:57:25" (3/3) ... [2022-07-23 12:57:25,319 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test9-2.i [2022-07-23 12:57:25,331 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 12:57:25,332 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 536 error locations. [2022-07-23 12:57:25,393 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 12:57:25,398 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@65dc0372, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5358747 [2022-07-23 12:57:25,399 INFO L358 AbstractCegarLoop]: Starting to check reachability of 536 error locations. [2022-07-23 12:57:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 2071 states, 1032 states have (on average 2.123062015503876) internal successors, (2191), 2065 states have internal predecessors, (2191), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:57:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:57:25,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:25,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:57:25,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:25,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2022-07-23 12:57:25,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:25,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785357523] [2022-07-23 12:57:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:25,435 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 12:57:25,445 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 12:57:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:25,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:57:25,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:25,676 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 12:57:25,698 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 12:57:25,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:25,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:25,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785357523] [2022-07-23 12:57:25,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785357523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:25,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:25,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:57:25,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215036957] [2022-07-23 12:57:25,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:25,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:57:25,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:25,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:57:25,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:57:25,731 INFO L87 Difference]: Start difference. First operand has 2071 states, 1032 states have (on average 2.123062015503876) internal successors, (2191), 2065 states have internal predecessors, (2191), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) 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 12:57:28,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:28,181 INFO L93 Difference]: Finished difference Result 2235 states and 3301 transitions. [2022-07-23 12:57:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:57:28,183 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 12:57:28,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:28,217 INFO L225 Difference]: With dead ends: 2235 [2022-07-23 12:57:28,217 INFO L226 Difference]: Without dead ends: 2233 [2022-07-23 12:57:28,219 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 12:57:28,222 INFO L413 NwaCegarLoop]: 2636 mSDtfsCounter, 1985 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2488 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:28,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2488 Valid, 2785 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-23 12:57:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-07-23 12:57:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2055. [2022-07-23 12:57:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1032 states have (on average 2.0416666666666665) internal successors, (2107), 2049 states have internal predecessors, (2107), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:57:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3113 transitions. [2022-07-23 12:57:28,561 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3113 transitions. Word has length 3 [2022-07-23 12:57:28,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:28,561 INFO L495 AbstractCegarLoop]: Abstraction has 2055 states and 3113 transitions. [2022-07-23 12:57:28,562 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 12:57:28,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3113 transitions. [2022-07-23 12:57:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:57:28,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:28,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:57:28,576 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 12:57:28,770 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 12:57:28,771 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:28,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:28,772 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2022-07-23 12:57:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:28,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615989223] [2022-07-23 12:57:28,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:28,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:28,776 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 12:57:28,779 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 12:57:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:28,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:57:28,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:28,896 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 12:57:28,908 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 12:57:28,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:28,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:28,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615989223] [2022-07-23 12:57:28,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615989223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:28,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:28,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:57:28,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314134603] [2022-07-23 12:57:28,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:28,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:57:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:57:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:57:28,916 INFO L87 Difference]: Start difference. First operand 2055 states and 3113 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 12:57:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:32,286 INFO L93 Difference]: Finished difference Result 3463 states and 5553 transitions. [2022-07-23 12:57:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:57:32,287 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 12:57:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:32,307 INFO L225 Difference]: With dead ends: 3463 [2022-07-23 12:57:32,307 INFO L226 Difference]: Without dead ends: 3463 [2022-07-23 12:57:32,307 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 12:57:32,309 INFO L413 NwaCegarLoop]: 3417 mSDtfsCounter, 1440 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:32,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 5500 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-23 12:57:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2022-07-23 12:57:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3177. [2022-07-23 12:57:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 1655 states have (on average 2.015105740181269) internal successors, (3335), 3171 states have internal predecessors, (3335), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:57:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 5341 transitions. [2022-07-23 12:57:32,622 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 5341 transitions. Word has length 3 [2022-07-23 12:57:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:32,622 INFO L495 AbstractCegarLoop]: Abstraction has 3177 states and 5341 transitions. [2022-07-23 12:57:32,623 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 12:57:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 5341 transitions. [2022-07-23 12:57:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 12:57:32,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:32,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:57:32,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-23 12:57:32,835 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 12:57:32,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2022-07-23 12:57:32,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:32,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536730834] [2022-07-23 12:57:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:32,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:32,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:32,845 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 12:57:32,848 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 12:57:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:32,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:57:32,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:32,999 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 12:57:33,005 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 12:57:33,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:57:33,076 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 12:57:33,089 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:57:33,090 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 12:57:33,113 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 12:57:33,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:33,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536730834] [2022-07-23 12:57:33,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536730834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:33,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:33,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:57:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082495424] [2022-07-23 12:57:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:33,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:57:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:33,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:57:33,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:57:33,116 INFO L87 Difference]: Start difference. First operand 3177 states and 5341 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 12:57:37,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:37,521 INFO L93 Difference]: Finished difference Result 3344 states and 5516 transitions. [2022-07-23 12:57:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:57:37,521 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 12:57:37,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:37,539 INFO L225 Difference]: With dead ends: 3344 [2022-07-23 12:57:37,539 INFO L226 Difference]: Without dead ends: 3344 [2022-07-23 12:57:37,540 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 12:57:37,580 INFO L413 NwaCegarLoop]: 2363 mSDtfsCounter, 4223 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 1986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:37,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 2444 Invalid, 1986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-23 12:57:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3344 states. [2022-07-23 12:57:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3344 to 2044. [2022-07-23 12:57:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1032 states have (on average 2.0300387596899223) internal successors, (2095), 2038 states have internal predecessors, (2095), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:57:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 3101 transitions. [2022-07-23 12:57:37,835 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 3101 transitions. Word has length 7 [2022-07-23 12:57:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:37,836 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 3101 transitions. [2022-07-23 12:57:37,838 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 12:57:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 3101 transitions. [2022-07-23 12:57:37,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 12:57:37,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:37,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:57:37,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-23 12:57:38,050 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 12:57:38,051 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2022-07-23 12:57:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:38,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321815920] [2022-07-23 12:57:38,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:38,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:38,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:38,056 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 12:57:38,057 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 12:57:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:38,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:57:38,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:38,179 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 12:57:38,187 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 12:57:38,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:38,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:38,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321815920] [2022-07-23 12:57:38,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321815920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:38,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:38,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:57:38,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075954748] [2022-07-23 12:57:38,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:38,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:57:38,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:38,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:57:38,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:57:38,190 INFO L87 Difference]: Start difference. First operand 2044 states and 3101 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 12:57:40,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:40,445 INFO L93 Difference]: Finished difference Result 3210 states and 5288 transitions. [2022-07-23 12:57:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:57:40,447 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 12:57:40,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:40,463 INFO L225 Difference]: With dead ends: 3210 [2022-07-23 12:57:40,463 INFO L226 Difference]: Without dead ends: 3210 [2022-07-23 12:57:40,464 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 12:57:40,466 INFO L413 NwaCegarLoop]: 4866 mSDtfsCounter, 1804 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 7123 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:40,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 7123 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-23 12:57:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2022-07-23 12:57:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 1997. [2022-07-23 12:57:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1997 states, 1032 states have (on average 1.9844961240310077) internal successors, (2048), 1991 states have internal predecessors, (2048), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:57:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 3054 transitions. [2022-07-23 12:57:40,766 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 3054 transitions. Word has length 8 [2022-07-23 12:57:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:40,767 INFO L495 AbstractCegarLoop]: Abstraction has 1997 states and 3054 transitions. [2022-07-23 12:57:40,767 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 12:57:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 3054 transitions. [2022-07-23 12:57:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-23 12:57:40,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:40,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:57:40,780 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 12:57:40,978 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 12:57:40,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:40,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2022-07-23 12:57:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:40,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469417910] [2022-07-23 12:57:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:40,982 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 12:57:40,984 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 12:57:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:41,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:57:41,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:41,109 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 12:57:41,131 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 12:57:41,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:41,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:41,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469417910] [2022-07-23 12:57:41,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469417910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:41,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:41,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:57:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656988923] [2022-07-23 12:57:41,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:41,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:57:41,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:41,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:57:41,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:57:41,135 INFO L87 Difference]: Start difference. First operand 1997 states and 3054 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 12:57:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:43,775 INFO L93 Difference]: Finished difference Result 3275 states and 5356 transitions. [2022-07-23 12:57:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:57:43,776 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 12:57:43,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:43,791 INFO L225 Difference]: With dead ends: 3275 [2022-07-23 12:57:43,792 INFO L226 Difference]: Without dead ends: 3275 [2022-07-23 12:57:43,792 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 12:57:43,793 INFO L413 NwaCegarLoop]: 5058 mSDtfsCounter, 1489 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 7481 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:43,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 7481 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-23 12:57:43,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2022-07-23 12:57:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2019. [2022-07-23 12:57:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 1064 states have (on average 1.9774436090225564) internal successors, (2104), 2013 states have internal predecessors, (2104), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-07-23 12:57:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 3110 transitions. [2022-07-23 12:57:44,018 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 3110 transitions. Word has length 8 [2022-07-23 12:57:44,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:44,019 INFO L495 AbstractCegarLoop]: Abstraction has 2019 states and 3110 transitions. [2022-07-23 12:57:44,019 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 12:57:44,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 3110 transitions. [2022-07-23 12:57:44,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 12:57:44,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:44,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:57:44,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-23 12:57:44,229 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 12:57:44,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr429REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:44,230 INFO L85 PathProgramCache]: Analyzing trace with hash 874110197, now seen corresponding path program 1 times [2022-07-23 12:57:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:44,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826796194] [2022-07-23 12:57:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:44,231 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:44,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:44,233 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 12:57:44,234 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 12:57:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:44,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:57:44,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:44,388 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 12:57:44,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:44,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:44,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826796194] [2022-07-23 12:57:44,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826796194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:44,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:44,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:57:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288166789] [2022-07-23 12:57:44,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:44,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:57:44,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:57:44,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:57:44,391 INFO L87 Difference]: Start difference. First operand 2019 states and 3110 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 12:57:44,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:44,671 INFO L93 Difference]: Finished difference Result 3486 states and 5612 transitions. [2022-07-23 12:57:44,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:57:44,672 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 12:57:44,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:44,686 INFO L225 Difference]: With dead ends: 3486 [2022-07-23 12:57:44,687 INFO L226 Difference]: Without dead ends: 3486 [2022-07-23 12:57:44,687 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 12:57:44,688 INFO L413 NwaCegarLoop]: 3606 mSDtfsCounter, 1560 mSDsluCounter, 2887 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:44,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 6493 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:57:44,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3486 states. [2022-07-23 12:57:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3486 to 3193. [2022-07-23 12:57:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 1738 states have (on average 1.9568469505178365) internal successors, (3401), 3187 states have internal predecessors, (3401), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:57:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 5407 transitions. [2022-07-23 12:57:44,967 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 5407 transitions. Word has length 11 [2022-07-23 12:57:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:44,967 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 5407 transitions. [2022-07-23 12:57:44,968 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 12:57:44,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 5407 transitions. [2022-07-23 12:57:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 12:57:44,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:44,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:57:44,982 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 12:57:45,178 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 12:57:45,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr340REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash -702153283, now seen corresponding path program 1 times [2022-07-23 12:57:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:45,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172800800] [2022-07-23 12:57:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:45,183 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 12:57:45,184 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 12:57:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:45,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:57:45,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:45,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 12:57:45,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:45,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172800800] [2022-07-23 12:57:45,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172800800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:45,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:45,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:57:45,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968925247] [2022-07-23 12:57:45,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:45,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:57:45,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:57:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:57:45,301 INFO L87 Difference]: Start difference. First operand 3193 states and 5407 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 12:57:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:45,355 INFO L93 Difference]: Finished difference Result 3347 states and 5547 transitions. [2022-07-23 12:57:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:57:45,355 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 12:57:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:45,370 INFO L225 Difference]: With dead ends: 3347 [2022-07-23 12:57:45,371 INFO L226 Difference]: Without dead ends: 3347 [2022-07-23 12:57:45,371 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 12:57:45,372 INFO L413 NwaCegarLoop]: 3202 mSDtfsCounter, 1394 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1894 SdHoareTripleChecker+Valid, 4519 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 12:57:45,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1894 Valid, 4519 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:57:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2022-07-23 12:57:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 3133. [2022-07-23 12:57:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 1702 states have (on average 1.9477085781433607) internal successors, (3315), 3127 states have internal predecessors, (3315), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:57:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 5321 transitions. [2022-07-23 12:57:45,634 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 5321 transitions. Word has length 13 [2022-07-23 12:57:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:45,635 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 5321 transitions. [2022-07-23 12:57:45,635 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 12:57:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 5321 transitions. [2022-07-23 12:57:45,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 12:57:45,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:45,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:57:45,647 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 12:57:45,846 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 12:57:45,846 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr534ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 240246254, now seen corresponding path program 1 times [2022-07-23 12:57:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:45,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71920931] [2022-07-23 12:57:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:45,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:45,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:45,848 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 12:57:45,849 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 12:57:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:46,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:57:46,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:46,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:57:46,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:57:46,056 INFO L356 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2022-07-23 12:57:46,057 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 29 treesize of output 36 [2022-07-23 12:57:46,091 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-23 12:57:46,091 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 60 treesize of output 20 [2022-07-23 12:57:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:57:46,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:46,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:46,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71920931] [2022-07-23 12:57:46,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71920931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:46,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:46,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:57:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521451796] [2022-07-23 12:57:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:46,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:57:46,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:46,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:57:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:57:46,113 INFO L87 Difference]: Start difference. First operand 3133 states and 5321 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 12:57:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:48,779 INFO L93 Difference]: Finished difference Result 5450 states and 9669 transitions. [2022-07-23 12:57:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:57:48,780 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 12:57:48,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:48,800 INFO L225 Difference]: With dead ends: 5450 [2022-07-23 12:57:48,801 INFO L226 Difference]: Without dead ends: 5450 [2022-07-23 12:57:48,801 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 12:57:48,802 INFO L413 NwaCegarLoop]: 3461 mSDtfsCounter, 1330 mSDsluCounter, 5812 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 9273 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:48,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 9273 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 674 Invalid, 0 Unknown, 37 Unchecked, 2.5s Time] [2022-07-23 12:57:48,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5450 states. [2022-07-23 12:57:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5450 to 3132. [2022-07-23 12:57:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 1701 states have (on average 1.9476778365667256) internal successors, (3313), 3126 states have internal predecessors, (3313), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:57:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5319 transitions. [2022-07-23 12:57:49,272 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5319 transitions. Word has length 14 [2022-07-23 12:57:49,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:49,272 INFO L495 AbstractCegarLoop]: Abstraction has 3132 states and 5319 transitions. [2022-07-23 12:57:49,272 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 12:57:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5319 transitions. [2022-07-23 12:57:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 12:57:49,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:49,274 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 12:57:49,287 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 12:57:49,484 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 12:57:49,484 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2022-07-23 12:57:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:49,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165690803] [2022-07-23 12:57:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:49,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:49,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:49,488 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 12:57:49,490 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 12:57:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:49,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 12:57:49,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:49,638 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 12:57:49,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:49,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165690803] [2022-07-23 12:57:49,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165690803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:49,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:49,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:57:49,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621185302] [2022-07-23 12:57:49,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:49,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:57:49,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:49,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:57:49,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:57:49,641 INFO L87 Difference]: Start difference. First operand 3132 states and 5319 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 12:57:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:49,680 INFO L93 Difference]: Finished difference Result 3072 states and 5233 transitions. [2022-07-23 12:57:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:57:49,681 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 12:57:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:49,689 INFO L225 Difference]: With dead ends: 3072 [2022-07-23 12:57:49,689 INFO L226 Difference]: Without dead ends: 3072 [2022-07-23 12:57:49,690 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 12:57:49,690 INFO L413 NwaCegarLoop]: 2954 mSDtfsCounter, 1933 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 3481 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 12:57:49,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 3481 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:57:49,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2022-07-23 12:57:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 3072. [2022-07-23 12:57:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 1665 states have (on average 1.9381381381381382) internal successors, (3227), 3066 states have internal predecessors, (3227), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:57:49,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5233 transitions. [2022-07-23 12:57:49,954 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 5233 transitions. Word has length 18 [2022-07-23 12:57:49,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:49,954 INFO L495 AbstractCegarLoop]: Abstraction has 3072 states and 5233 transitions. [2022-07-23 12:57:49,955 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 12:57:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 5233 transitions. [2022-07-23 12:57:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-23 12:57:49,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:49,955 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 12:57:49,966 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 12:57:50,166 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 12:57:50,166 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:50,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2022-07-23 12:57:50,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:50,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266743065] [2022-07-23 12:57:50,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:50,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:50,168 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 12:57:50,169 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 12:57:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:50,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:57:50,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:50,313 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 12:57:50,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:50,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:50,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266743065] [2022-07-23 12:57:50,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266743065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:50,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:50,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:57:50,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133251804] [2022-07-23 12:57:50,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:50,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:57:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:50,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:57:50,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:57:50,316 INFO L87 Difference]: Start difference. First operand 3072 states and 5233 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 12:57:50,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:50,401 INFO L93 Difference]: Finished difference Result 3044 states and 5177 transitions. [2022-07-23 12:57:50,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:57:50,402 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 12:57:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:50,411 INFO L225 Difference]: With dead ends: 3044 [2022-07-23 12:57:50,412 INFO L226 Difference]: Without dead ends: 3044 [2022-07-23 12:57:50,412 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 12:57:50,413 INFO L413 NwaCegarLoop]: 2909 mSDtfsCounter, 1904 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2407 SdHoareTripleChecker+Valid, 6338 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 12:57:50,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2407 Valid, 6338 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:57:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2022-07-23 12:57:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3042. [2022-07-23 12:57:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3042 states, 1649 states have (on average 1.9217707701637357) internal successors, (3169), 3036 states have internal predecessors, (3169), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:57:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3042 states to 3042 states and 5175 transitions. [2022-07-23 12:57:50,682 INFO L78 Accepts]: Start accepts. Automaton has 3042 states and 5175 transitions. Word has length 20 [2022-07-23 12:57:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:50,682 INFO L495 AbstractCegarLoop]: Abstraction has 3042 states and 5175 transitions. [2022-07-23 12:57:50,682 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 12:57:50,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3042 states and 5175 transitions. [2022-07-23 12:57:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 12:57:50,683 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:50,684 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 12:57:50,694 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 12:57:50,894 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 12:57:50,894 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:50,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2022-07-23 12:57:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:50,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101392873] [2022-07-23 12:57:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:50,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:50,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:50,896 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 12:57:50,897 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 12:57:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:51,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:57:51,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:51,063 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 12:57:51,111 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 12:57:51,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:51,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:51,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101392873] [2022-07-23 12:57:51,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101392873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:51,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:51,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:57:51,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951098394] [2022-07-23 12:57:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:51,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:57:51,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:57:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:57:51,114 INFO L87 Difference]: Start difference. First operand 3042 states and 5175 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 12:57:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:54,570 INFO L93 Difference]: Finished difference Result 5473 states and 9671 transitions. [2022-07-23 12:57:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:57:54,573 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 12:57:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:54,590 INFO L225 Difference]: With dead ends: 5473 [2022-07-23 12:57:54,591 INFO L226 Difference]: Without dead ends: 5473 [2022-07-23 12:57:54,591 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 12:57:54,591 INFO L413 NwaCegarLoop]: 2988 mSDtfsCounter, 3442 mSDsluCounter, 3514 mSDsCounter, 0 mSdLazyCounter, 1871 mSolverCounterSat, 1019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 6502 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1019 IncrementalHoareTripleChecker+Valid, 1871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:54,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 6502 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1019 Valid, 1871 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-23 12:57:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5473 states. [2022-07-23 12:57:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5473 to 3038. [2022-07-23 12:57:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3038 states, 1649 states have (on average 1.9169193450576107) internal successors, (3161), 3032 states have internal predecessors, (3161), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:57:54,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 5167 transitions. [2022-07-23 12:57:54,974 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 5167 transitions. Word has length 34 [2022-07-23 12:57:54,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:57:54,975 INFO L495 AbstractCegarLoop]: Abstraction has 3038 states and 5167 transitions. [2022-07-23 12:57:54,975 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 12:57:54,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 5167 transitions. [2022-07-23 12:57:54,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 12:57:54,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:57:54,976 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 12:57:54,989 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 12:57:55,186 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 12:57:55,187 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:57:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:57:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2022-07-23 12:57:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:57:55,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668265961] [2022-07-23 12:57:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:57:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:57:55,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:57:55,190 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 12:57:55,193 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 12:57:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:57:55,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:57:55,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:57:55,336 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 12:57:55,486 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 12:57:55,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:57:55,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:57:55,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668265961] [2022-07-23 12:57:55,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668265961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:57:55,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:57:55,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:57:55,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487794301] [2022-07-23 12:57:55,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:57:55,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:57:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:57:55,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:57:55,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:57:55,489 INFO L87 Difference]: Start difference. First operand 3038 states and 5167 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 12:57:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:57:59,724 INFO L93 Difference]: Finished difference Result 5530 states and 9693 transitions. [2022-07-23 12:57:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:57:59,724 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 12:57:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:57:59,740 INFO L225 Difference]: With dead ends: 5530 [2022-07-23 12:57:59,740 INFO L226 Difference]: Without dead ends: 5530 [2022-07-23 12:57:59,740 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 12:57:59,741 INFO L413 NwaCegarLoop]: 5152 mSDtfsCounter, 2908 mSDsluCounter, 4930 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 10082 SdHoareTripleChecker+Invalid, 3174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:57:59,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 10082 Invalid, 3174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-23 12:57:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2022-07-23 12:58:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 3034. [2022-07-23 12:58:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 1649 states have (on average 1.9120679199514858) internal successors, (3153), 3028 states have internal predecessors, (3153), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:58:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 5159 transitions. [2022-07-23 12:58:00,204 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 5159 transitions. Word has length 34 [2022-07-23 12:58:00,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:00,204 INFO L495 AbstractCegarLoop]: Abstraction has 3034 states and 5159 transitions. [2022-07-23 12:58:00,204 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 12:58:00,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 5159 transitions. [2022-07-23 12:58:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-23 12:58:00,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:00,209 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 12:58:00,224 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 12:58:00,424 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 12:58:00,424 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:00,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2022-07-23 12:58:00,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:00,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743007117] [2022-07-23 12:58:00,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:58:00,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:00,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:00,427 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 12:58:00,428 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 12:58:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:58:00,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:58:00,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:00,675 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 12:58:00,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:58:00,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:00,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743007117] [2022-07-23 12:58:00,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743007117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:58:00,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:58:00,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:58:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803265377] [2022-07-23 12:58:00,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:58:00,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:58:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:58:00,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:58:00,676 INFO L87 Difference]: Start difference. First operand 3034 states and 5159 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 12:58:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:00,732 INFO L93 Difference]: Finished difference Result 3022 states and 5139 transitions. [2022-07-23 12:58:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:58:00,732 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 12:58:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:00,744 INFO L225 Difference]: With dead ends: 3022 [2022-07-23 12:58:00,744 INFO L226 Difference]: Without dead ends: 3022 [2022-07-23 12:58:00,745 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 12:58:00,746 INFO L413 NwaCegarLoop]: 2903 mSDtfsCounter, 1880 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 6316 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 12:58:00,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 6316 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:58:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-07-23 12:58:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2022-07-23 12:58:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 1637 states have (on average 1.9138668295662797) internal successors, (3133), 3016 states have internal predecessors, (3133), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:58:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 5139 transitions. [2022-07-23 12:58:00,992 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 5139 transitions. Word has length 52 [2022-07-23 12:58:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:00,994 INFO L495 AbstractCegarLoop]: Abstraction has 3022 states and 5139 transitions. [2022-07-23 12:58:00,994 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 12:58:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 5139 transitions. [2022-07-23 12:58:00,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-23 12:58:00,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:00,997 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 12:58:01,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-23 12:58:01,209 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 12:58:01,209 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2022-07-23 12:58:01,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:01,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636960507] [2022-07-23 12:58:01,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:58:01,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:01,212 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 12:58:01,214 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 12:58:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:58:01,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:58:01,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:01,568 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 12:58:01,573 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 12:58:01,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:58:01,897 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 12:58:01,906 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:58:01,906 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 12:58:01,917 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 12:58:01,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:58:01,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:01,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636960507] [2022-07-23 12:58:01,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636960507] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:58:01,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:58:01,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:58:01,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285100857] [2022-07-23 12:58:01,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:58:01,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:58:01,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:01,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:58:01,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:58:01,920 INFO L87 Difference]: Start difference. First operand 3022 states and 5139 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 12:58:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:05,757 INFO L93 Difference]: Finished difference Result 5224 states and 9400 transitions. [2022-07-23 12:58:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:58:05,758 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 12:58:05,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:05,771 INFO L225 Difference]: With dead ends: 5224 [2022-07-23 12:58:05,771 INFO L226 Difference]: Without dead ends: 5224 [2022-07-23 12:58:05,771 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 12:58:05,772 INFO L413 NwaCegarLoop]: 2951 mSDtfsCounter, 4397 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5400 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:58:05,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5400 Valid, 4163 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-23 12:58:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2022-07-23 12:58:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 2952. [2022-07-23 12:58:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2952 states, 1605 states have (on average 1.8872274143302181) internal successors, (3029), 2946 states have internal predecessors, (3029), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:58:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 5035 transitions. [2022-07-23 12:58:06,208 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 5035 transitions. Word has length 60 [2022-07-23 12:58:06,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:06,209 INFO L495 AbstractCegarLoop]: Abstraction has 2952 states and 5035 transitions. [2022-07-23 12:58:06,209 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 12:58:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 5035 transitions. [2022-07-23 12:58:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 12:58:06,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:06,210 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 12:58:06,225 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 12:58:06,425 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 12:58:06,426 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2022-07-23 12:58:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:06,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809691429] [2022-07-23 12:58:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:58:06,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:06,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:06,431 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 12:58:06,434 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 12:58:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:58:06,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:58:06,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:06,706 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 12:58:06,715 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 12:58:06,737 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 12:58:06,746 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 12:58:06,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:58:06,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:06,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809691429] [2022-07-23 12:58:06,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809691429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:58:06,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:58:06,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:58:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536520895] [2022-07-23 12:58:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:58:06,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:58:06,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:58:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:58:06,750 INFO L87 Difference]: Start difference. First operand 2952 states and 5035 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 12:58:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:08,373 INFO L93 Difference]: Finished difference Result 2951 states and 5034 transitions. [2022-07-23 12:58:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:58:08,373 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 12:58:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:08,382 INFO L225 Difference]: With dead ends: 2951 [2022-07-23 12:58:08,383 INFO L226 Difference]: Without dead ends: 2951 [2022-07-23 12:58:08,385 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 12:58:08,385 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 4 mSDsluCounter, 7351 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10214 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 12:58:08,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10214 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-23 12:58:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-07-23 12:58:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2951. [2022-07-23 12:58:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 1605 states have (on average 1.8866043613707164) internal successors, (3028), 2945 states have internal predecessors, (3028), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:58:08,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 5034 transitions. [2022-07-23 12:58:08,620 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 5034 transitions. Word has length 65 [2022-07-23 12:58:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:08,622 INFO L495 AbstractCegarLoop]: Abstraction has 2951 states and 5034 transitions. [2022-07-23 12:58:08,622 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 12:58:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 5034 transitions. [2022-07-23 12:58:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 12:58:08,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:08,623 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 12:58:08,636 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 12:58:08,836 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 12:58:08,836 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:08,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2022-07-23 12:58:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:08,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392105042] [2022-07-23 12:58:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:58:08,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:08,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:08,840 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 12:58:08,842 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 12:58:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:58:09,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 12:58:09,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:09,146 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 12:58:09,162 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 12:58:09,172 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 12:58:09,213 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 12:58:09,217 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 12:58:09,230 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 12:58:09,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:58:09,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:09,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392105042] [2022-07-23 12:58:09,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392105042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:58:09,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:58:09,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:58:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535266026] [2022-07-23 12:58:09,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:58:09,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:58:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:09,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:58:09,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:58:09,233 INFO L87 Difference]: Start difference. First operand 2951 states and 5034 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 12:58:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:11,558 INFO L93 Difference]: Finished difference Result 2950 states and 5033 transitions. [2022-07-23 12:58:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:58:11,558 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 12:58:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:11,568 INFO L225 Difference]: With dead ends: 2950 [2022-07-23 12:58:11,568 INFO L226 Difference]: Without dead ends: 2950 [2022-07-23 12:58:11,569 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 12:58:11,569 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 2 mSDsluCounter, 7387 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10250 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:58:11,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10250 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-23 12:58:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2022-07-23 12:58:11,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2950. [2022-07-23 12:58:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 1604 states have (on average 1.8871571072319202) internal successors, (3027), 2944 states have internal predecessors, (3027), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2022-07-23 12:58:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5033 transitions. [2022-07-23 12:58:11,769 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5033 transitions. Word has length 65 [2022-07-23 12:58:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:11,770 INFO L495 AbstractCegarLoop]: Abstraction has 2950 states and 5033 transitions. [2022-07-23 12:58:11,770 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 12:58:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5033 transitions. [2022-07-23 12:58:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-23 12:58:11,771 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:11,771 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 12:58:11,784 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 12:58:11,984 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 12:58:11,985 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:11,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1522422575, now seen corresponding path program 1 times [2022-07-23 12:58:11,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:11,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618636834] [2022-07-23 12:58:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:58:11,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:11,989 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 12:58:11,991 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 12:58:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:58:12,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:58:12,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:12,314 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 12:58:12,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:58:12,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:12,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618636834] [2022-07-23 12:58:12,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618636834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:58:12,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:58:12,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:58:12,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69719650] [2022-07-23 12:58:12,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:58:12,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:58:12,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:12,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:58:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:58:12,317 INFO L87 Difference]: Start difference. First operand 2950 states and 5033 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 12:58:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:12,391 INFO L93 Difference]: Finished difference Result 2953 states and 5037 transitions. [2022-07-23 12:58:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:58:12,392 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 12:58:12,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:12,420 INFO L225 Difference]: With dead ends: 2953 [2022-07-23 12:58:12,425 INFO L226 Difference]: Without dead ends: 2953 [2022-07-23 12:58:12,426 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 12:58:12,426 INFO L413 NwaCegarLoop]: 2863 mSDtfsCounter, 2 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8584 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 12:58:12,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8584 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 12:58:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2022-07-23 12:58:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2953. [2022-07-23 12:58:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 1606 states have (on average 1.8866749688667497) internal successors, (3030), 2947 states have internal predecessors, (3030), 1003 states have call successors, (1003), 2 states have call predecessors, (1003), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:58:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 5037 transitions. [2022-07-23 12:58:12,667 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 5037 transitions. Word has length 73 [2022-07-23 12:58:12,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:12,667 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 5037 transitions. [2022-07-23 12:58:12,667 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 12:58:12,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 5037 transitions. [2022-07-23 12:58:12,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 12:58:12,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:12,668 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 12:58:12,684 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 12:58:12,884 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 12:58:12,884 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:12,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1741939320, now seen corresponding path program 1 times [2022-07-23 12:58:12,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:12,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915848136] [2022-07-23 12:58:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:58:12,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:12,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:12,887 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 12:58:12,888 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 12:58:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:58:13,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:58:13,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:13,167 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 12:58:13,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:58:13,250 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 12:58:13,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:13,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915848136] [2022-07-23 12:58:13,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915848136] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:58:13,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:58:13,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 12:58:13,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962276445] [2022-07-23 12:58:13,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:58:13,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:58:13,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:13,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:58:13,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:58:13,252 INFO L87 Difference]: Start difference. First operand 2953 states and 5037 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 12:58:13,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:13,441 INFO L93 Difference]: Finished difference Result 2965 states and 5054 transitions. [2022-07-23 12:58:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:58:13,442 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 12:58:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:13,485 INFO L225 Difference]: With dead ends: 2965 [2022-07-23 12:58:13,486 INFO L226 Difference]: Without dead ends: 2965 [2022-07-23 12:58:13,486 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 12:58:13,487 INFO L413 NwaCegarLoop]: 2864 mSDtfsCounter, 22 mSDsluCounter, 5724 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8588 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:58:13,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8588 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:58:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2022-07-23 12:58:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2963. [2022-07-23 12:58:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2963 states, 1615 states have (on average 1.8854489164086687) internal successors, (3045), 2956 states have internal predecessors, (3045), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:58:13,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 5052 transitions. [2022-07-23 12:58:13,725 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 5052 transitions. Word has length 74 [2022-07-23 12:58:13,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:13,726 INFO L495 AbstractCegarLoop]: Abstraction has 2963 states and 5052 transitions. [2022-07-23 12:58:13,726 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 12:58:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 5052 transitions. [2022-07-23 12:58:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 12:58:13,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:13,727 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 12:58:13,742 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 12:58:13,942 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 12:58:13,943 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:13,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:13,944 INFO L85 PathProgramCache]: Analyzing trace with hash 755671407, now seen corresponding path program 2 times [2022-07-23 12:58:13,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:13,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708576418] [2022-07-23 12:58:13,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:58:13,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:13,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:13,946 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 12:58:13,975 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 12:58:14,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 12:58:14,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:58:14,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 12:58:14,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:14,609 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 12:58:14,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:58:14,766 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 12:58:14,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:14,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1708576418] [2022-07-23 12:58:14,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1708576418] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:58:14,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:58:14,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-23 12:58:14,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809387152] [2022-07-23 12:58:14,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:58:14,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 12:58:14,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:14,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 12:58:14,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 12:58:14,769 INFO L87 Difference]: Start difference. First operand 2963 states and 5052 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 12:58:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:15,368 INFO L93 Difference]: Finished difference Result 2984 states and 5080 transitions. [2022-07-23 12:58:15,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 12:58:15,369 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 12:58:15,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:15,379 INFO L225 Difference]: With dead ends: 2984 [2022-07-23 12:58:15,379 INFO L226 Difference]: Without dead ends: 2980 [2022-07-23 12:58:15,380 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 12:58:15,381 INFO L413 NwaCegarLoop]: 2867 mSDtfsCounter, 67 mSDsluCounter, 14318 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 17185 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:58:15,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 17185 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:58:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2022-07-23 12:58:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2972. [2022-07-23 12:58:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 1624 states have (on average 1.8823891625615763) internal successors, (3057), 2965 states have internal predecessors, (3057), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:58:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 5064 transitions. [2022-07-23 12:58:15,619 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 5064 transitions. Word has length 77 [2022-07-23 12:58:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:15,619 INFO L495 AbstractCegarLoop]: Abstraction has 2972 states and 5064 transitions. [2022-07-23 12:58:15,619 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 12:58:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 5064 transitions. [2022-07-23 12:58:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 12:58:15,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:15,620 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 12:58:15,638 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 12:58:15,835 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 12:58:15,835 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1043203377, now seen corresponding path program 3 times [2022-07-23 12:58:15,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:15,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495024828] [2022-07-23 12:58:15,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 12:58:15,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:15,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:15,838 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 12:58:15,840 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 12:58:16,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 12:58:16,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:58:16,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 12:58:16,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:16,772 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 12:58:16,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:58:17,414 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 12:58:17,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:17,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495024828] [2022-07-23 12:58:17,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495024828] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:58:17,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:58:17,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-23 12:58:17,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463683613] [2022-07-23 12:58:17,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:58:17,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-23 12:58:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:17,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-23 12:58:17,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-23 12:58:17,417 INFO L87 Difference]: Start difference. First operand 2972 states and 5064 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 12:58:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:20,180 INFO L93 Difference]: Finished difference Result 3014 states and 5126 transitions. [2022-07-23 12:58:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-23 12:58:20,181 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 12:58:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:20,191 INFO L225 Difference]: With dead ends: 3014 [2022-07-23 12:58:20,191 INFO L226 Difference]: Without dead ends: 3008 [2022-07-23 12:58:20,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 12:58:20,192 INFO L413 NwaCegarLoop]: 2872 mSDtfsCounter, 162 mSDsluCounter, 40120 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 42992 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-23 12:58:20,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 42992 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-23 12:58:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-07-23 12:58:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2990. [2022-07-23 12:58:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 1642 states have (on average 1.8757612667478685) internal successors, (3080), 2983 states have internal predecessors, (3080), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:58:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 5087 transitions. [2022-07-23 12:58:20,477 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 5087 transitions. Word has length 83 [2022-07-23 12:58:20,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:20,478 INFO L495 AbstractCegarLoop]: Abstraction has 2990 states and 5087 transitions. [2022-07-23 12:58:20,478 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 12:58:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 5087 transitions. [2022-07-23 12:58:20,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 12:58:20,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:20,480 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 12:58:20,499 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 12:58:20,694 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 12:58:20,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash -420145777, now seen corresponding path program 4 times [2022-07-23 12:58:20,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:20,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456597607] [2022-07-23 12:58:20,696 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 12:58:20,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:20,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:20,698 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 12:58:20,700 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 12:58:21,032 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 12:58:21,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:58:21,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 12:58:21,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:21,426 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 12:58:21,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:58:22,858 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 12:58:22,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:22,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456597607] [2022-07-23 12:58:22,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456597607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:58:22,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:58:22,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-23 12:58:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129698321] [2022-07-23 12:58:22,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:58:22,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 12:58:22,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:58:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 12:58:22,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 12:58:22,862 INFO L87 Difference]: Start difference. First operand 2990 states and 5087 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 12:58:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:58:33,028 INFO L93 Difference]: Finished difference Result 3070 states and 5199 transitions. [2022-07-23 12:58:33,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-23 12:58:33,029 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 12:58:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:58:33,038 INFO L225 Difference]: With dead ends: 3070 [2022-07-23 12:58:33,039 INFO L226 Difference]: Without dead ends: 3066 [2022-07-23 12:58:33,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 12:58:33,044 INFO L413 NwaCegarLoop]: 2884 mSDtfsCounter, 428 mSDsluCounter, 66245 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 69129 SdHoareTripleChecker+Invalid, 2843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:58:33,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 69129 Invalid, 2843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-23 12:58:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3066 states. [2022-07-23 12:58:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3066 to 3024. [2022-07-23 12:58:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3024 states, 1676 states have (on average 1.8651551312649164) internal successors, (3126), 3017 states have internal predecessors, (3126), 1003 states have call successors, (1003), 3 states have call predecessors, (1003), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2022-07-23 12:58:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 5133 transitions. [2022-07-23 12:58:33,330 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 5133 transitions. Word has length 95 [2022-07-23 12:58:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:58:33,331 INFO L495 AbstractCegarLoop]: Abstraction has 3024 states and 5133 transitions. [2022-07-23 12:58:33,331 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 12:58:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 5133 transitions. [2022-07-23 12:58:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 12:58:33,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:58:33,332 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 12:58:33,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-23 12:58:33,547 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 12:58:33,548 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 533 more)] === [2022-07-23 12:58:33,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:58:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash 795332591, now seen corresponding path program 5 times [2022-07-23 12:58:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:58:33,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762721075] [2022-07-23 12:58:33,549 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:58:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:58:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:58:33,551 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 12:58:33,551 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 12:58:34,936 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 12:58:34,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:58:34,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-23 12:58:34,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:58:34,989 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 12:58:35,074 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 12:58:35,083 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:58:35,084 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 12:58:35,108 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 12:58:35,121 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 12:58:35,203 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 12:58:35,209 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 12:58:35,248 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1910 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1910) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1911))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,260 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,271 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915)))) is different from true [2022-07-23 12:58:35,319 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,357 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,368 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-07-23 12:58:35,403 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|))) is different from true [2022-07-23 12:58:35,441 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932)))) is different from true [2022-07-23 12:58:35,454 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,469 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1937))) (exists ((v_ArrVal_1936 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1936) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,515 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,634 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,645 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,683 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,694 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,704 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960)))) is different from true [2022-07-23 12:58:35,768 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966)))) is different from true [2022-07-23 12:58:35,799 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,813 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 12:58:35,822 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1974 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1974) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1975 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1975))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,876 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,907 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,916 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986)))) is different from true [2022-07-23 12:58:35,926 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1988))) (exists ((v_ArrVal_1989 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1989))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,934 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1991))) (exists ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1990))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,945 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1993) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1992 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1992) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,952 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1994) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1995 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1995))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:35,965 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1997 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1997))) (exists ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1996))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 12:58:36,004 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:58:36,005 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 12:58:36,011 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 12:58:36,044 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 12:58:36,050 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 12:58:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 120 trivial. 854 not checked. [2022-07-23 12:58:36,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:58:36,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-23 12:58:36,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:58:36,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762721075] [2022-07-23 12:58:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762721075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 12:58:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1757496075] [2022-07-23 12:58:36,752 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 12:58:36,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 12:58:36,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 12:58:36,754 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 12:58:36,758 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:00:06,213 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-23 13:00:06,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 13:00:06,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-23 13:00:06,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:00:06,438 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:00:06,517 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 13:00:06,517 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:00:06,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 13:00:06,530 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:00:06,538 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:00:06,585 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:00:06,589 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:00:06,639 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,648 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,657 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2471))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,666 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473)))) is different from true [2022-07-23 13:00:06,676 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,686 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,696 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:00:06,706 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481))) (exists ((v_ArrVal_2482 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2482) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,726 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2483) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,736 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-23 13:00:06,747 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,757 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,766 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,776 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,788 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2496 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2496)))) is different from true [2022-07-23 13:00:06,798 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498))) (exists ((v_ArrVal_2497 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2497) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,832 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,844 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,854 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2505 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2505) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:00:06,864 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507))) (exists ((v_ArrVal_2508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2508)))) is different from true [2022-07-23 13:00:06,898 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,908 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,918 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,928 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,937 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,948 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2522 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2522) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,958 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524))) (exists ((v_ArrVal_2523 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2523))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:06,992 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-23 13:00:07,002 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:07,040 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-23 13:00:07,050 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535)))) is different from true [2022-07-23 13:00:07,060 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2537 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2537))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:00:07,070 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2540 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2540) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:07,081 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2541 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2541) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:00:07,092 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_2544 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2544) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-23 13:00:07,102 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2546 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2546) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2545 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2545) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:07,112 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2548 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2548))) (exists ((v_ArrVal_2547 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2547))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:07,121 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2549) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2550) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:07,130 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2551 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2551))) (exists ((v_ArrVal_2552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2552))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16)))) is different from true [2022-07-23 13:00:07,161 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 13:00:07,162 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:00:07,166 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:00:07,193 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:00:07,198 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:00:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 975 not checked. [2022-07-23 13:00:07,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 13:00:07,778 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2643 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-23 13:00:07,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1757496075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:00:07,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 13:00:07,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 47] total 75 [2022-07-23 13:00:07,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50583733] [2022-07-23 13:00:07,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 13:00:07,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-23 13:00:07,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 13:00:07,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-23 13:00:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=148, Unknown=77, NotChecked=5934, Total=6320 [2022-07-23 13:00:07,786 INFO L87 Difference]: Start difference. First operand 3024 states and 5133 transitions. Second operand has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 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:00:08,156 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1912) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1913))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527)))) is different from true [2022-07-23 13:00:08,168 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2534 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2534) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2511 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2511) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1981 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1981) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1973 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1973) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503))) (exists ((v_ArrVal_2536 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2536))) (exists ((v_ArrVal_1985 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1985))) (exists ((v_ArrVal_1951 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1951))) (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1971 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1971) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2512 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2512) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917))) (exists ((v_ArrVal_1956 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1956))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940))) (exists ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1925))) (exists ((v_ArrVal_1957 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1957))) (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1987))) (exists ((v_ArrVal_1984 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1984))) (exists ((v_ArrVal_1958 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1958))) (exists ((v_ArrVal_2530 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2530) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1970 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1970))) (exists ((v_ArrVal_1950 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1950))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_1980 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1980))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2513))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467))) (exists ((v_ArrVal_1959 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1959))) (exists ((v_ArrVal_2470 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2470) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_2504 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2504))) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_16))) (exists ((v_ArrVal_1967 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1967) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533))) (exists ((v_ArrVal_1986 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1986))) (exists ((v_ArrVal_1966 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1966))) (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2535 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2535))) (exists ((v_ArrVal_1972 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1972) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1924)))) is different from true [2022-07-23 13:00:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:00:15,226 INFO L93 Difference]: Finished difference Result 5270 states and 9439 transitions. [2022-07-23 13:00:15,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 13:00:15,229 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 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 117 [2022-07-23 13:00:15,230 INFO L84 Accepts]: Finished accepts. each prefix is rejected. [2022-07-23 13:00:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 2.1216216216216215) internal successors, (157), 76 states have internal predecessors, (157), 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 117